Stream Cyphers with One- and Two-Dimensional Cellular Automata

In the age of universal electronic connectivity and the ensuing possibility of message eavesdropping and electronic fraud, cryptography becomes a basic requirement to secure data storage and transmission. In this work we describe a single key cryptographic system based on one- and two-dimensional non-uniform cellular automata that produce high-quality pseudo-random bit sequences. The robustness of the scheme against cryptanalytic attacks is discussed and it is shown that direct cryptanalysis requires an exponentially growing amount of computational resources. The advantage of implementing the proposed scheme in hardware for high-speed operation is also discussed.

[1]  Puhua Guan,et al.  Cellular Automaton Public-Key Cryptosystem , 1987, Complex Syst..

[2]  Willi Meier,et al.  Analysis of Pseudo Random Sequence Generated by Cellular Automata , 1991, EUROCRYPT.

[3]  Marco Tomassini,et al.  Generating high-quality random numbers in parallel by cellular automata , 1999, Future Gener. Comput. Syst..

[4]  Parimal Pal Chaudhuri,et al.  Theory and Applications of Cellular Automata in Cryptography , 1994, IEEE Trans. Computers.

[5]  Stephen Wolfram Cryptography with Cellular Automata , 1985, CRYPTO.

[6]  Donald W. Davies,et al.  Advances in Cryptology — EUROCRYPT ’91 , 2001, Lecture Notes in Computer Science.

[7]  Howard C. Card,et al.  Parallel Random Number Generation for VLSI Systems Using Cellular Automata , 1989, IEEE Trans. Computers.

[8]  Howard Gutowitz,et al.  Cryptography with Dynamical Systems , 1993 .

[9]  Marco Tomassini,et al.  Generating Parallel Random Number Generators By Cellular Programming , 1996 .

[10]  N. Gisin,et al.  Quantum cryptography , 1998 .

[11]  Peter W. Shor,et al.  Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[12]  S. Wolfram Random sequence generation by cellular automata , 1986 .

[13]  Marco Tomassini,et al.  On the Generation of High-Quality Random Numbers by Two-Dimensional Cellular Automata , 2000, IEEE Trans. Computers.

[14]  Howard C. Card,et al.  Cellular automata-based pseudorandom number generators for built-in self-test , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[15]  H. C. Williams,et al.  Advances in Cryptology — CRYPTO ’85 Proceedings , 2000, Lecture Notes in Computer Science.