Design of cellular automata hardware for cryptographic applications

Franti, Eduard; Slav, Cristian; Balan, Traian; Dascălu, Maria-Iuliana

doi:10.1109/smicnd.2004.1403049

Cited by 2 publications

(2 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, the simple structure, when iterated several times, will produce complex patterns indicating its potential to simulate various sophisticated natural phenomena [5]. CA as a medium for encryption is an attractive idea in theory as most CA can be implanted on very fast hardware [6,7], as well as owing to its inherent features like parallelism, locality, simplicity, unpredictability and homogeneity.…”

Section: Introductionmentioning

confidence: 99%

A New Public Key Encryption Scheme based on Layered Cellular Automata

2014

KSII TIIS

View full text Add to dashboard Cite

Cellular automata (CA) based cryptosystem has been studied for almost three decades, yet most of previously reported researches focus on the symmetric key encryption schemes. Up to now, few CA based public key encryption scheme has been proposed. To fill the gap, in this paper, we propose a new public key encryption scheme based on layered cellular automata (LCA). Specifically, in the proposed scheme, based on the T-shaped neighborhood structure, we combine four one-dimensional reversible CAs (set as the private key) to form the transition rules of a two-dimension CA, where the two-dimension CA is set as the corresponding public key. Based on the hardness assumption of the Decisional Dependent CA problem in LCA, we formally prove the proposed scheme is indistinguishably secure against the chosen-plaintext attack (IND-CPA). In addition, we also use a numeric example to demonstrate its feasibility. Finally, analysis of key space and time efficiency are also carried out along with RSA-1024, and the simulation results demonstrate that our proposed scheme is more efficient.

show abstract

Section: Introductionmentioning

confidence: 99%

A New Public Key Encryption Scheme based on Layered Cellular Automata

2014

KSII TIIS

View full text Add to dashboard Cite

show abstract

“…These systems tend to have relatively slow implementations [12], and since we will always want more efficient and secure encryption algorithms, it makes sense to consider alternate techniques. Cellular automata (CA) as a medium for encryption is an attractive idea in theory because most CA can be implemented on very fast hardware [4,5,14], hence a CA-based scheme may have the potential to encrypt and decrypt messages faster than existing techniques.…”

Section: Introductionmentioning

confidence: 99%

A Cryptosystem Based on the Composition of Reversible Cellular Automata

Clarridge

Salomaa

2009

Language and Automata Theory and Applications

View full text Add to dashboard Cite

Abstract. We present conditions which guarantee that a composition of marker cellular automata has the same neighbourhood as each of the individual components. We show that, under certain technical assumptions, a marker cellular automaton has a unique inverse with a given neighbourhood. We use these results to develop a working key generation algorithm for a public-key cryptosystem based on reversible cellular automata originally conceived by Kari. We conclude with a discussion on security and practical considerations for the cryptosystem and give several ideas for future work.

show abstract

Design of cellular automata hardware for cryptographic applications

Cited by 2 publications

References 2 publications

A New Public Key Encryption Scheme based on Layered Cellular Automata

A New Public Key Encryption Scheme based on Layered Cellular Automata

A Cryptosystem Based on the Composition of Reversible Cellular Automata

Contact Info

Product

Resources

About