Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
C. Bennet, G. Brassard, and A. Ekert. Quantum cryptography. Scientific American, 267(4):50–57, October 1992.
P. Guam. Cellular automaton public key cryptosystems. Complex Systems, 1:51–56, 1987.
H. Gutowitz. Cryptography with dynamical systems. In E. Goles and N. Boccara, editors, Cellular Automata and Cooperative Phenomena. Kluwer Academic Press, 1993.
P. D. Hortensius, R. D. McLeod, and H. C. Card. Parallel random number generation for VLSI systems using cellular automata. IEEE Transactions on Computers, 38(10):1466–1473, October 1989.
P. D. Hortensius, R. D. McLeod, W. Pries, D. M. Miller, and H. C. Card. Cellular automata-based pseudorandom number generators for built-in self-test. IEEE Transactions on Computer-Aided Design, 8(8):842–859, August 1989.
W. Meier and O. Staffelbach. Analysis of pseudo random sequences generated by cellular automata. In Advances in Cryptology: Eurocrypt’ 91, volume 547 of Lecture Notes in Computer Science, pages 186–199. Springer-Verlag, Heidelberg, 1991.
S. Nandi, B. K. Kar, and P. P. Chaudhuri. Theory and applications of cellular automata in cryptography. IEEE Transactions on Computers, 43(12):1346–1357, December 1994.
B. Schneier. Applied Cryptography. John Wiley & Sons, New York, 1996.
P. Shor. Algorithms for quantum computation: discrete logarithms and factoring. In Proceedings 35th Annual Symposium of Fundations of Computer Science, pages 124–134, 1994.
M. Sipper and M. Tomassini. Generating parallel random number generators by cellular programming. International Journal of Modern Physics C, 7(2):181–190, 1996.
M. Tomassini, M. Sipper, and M. Perrenoud. On the generation of high-quality random numbers by two-dimensional cellular automata. IEEE Transactions on Computers. (to appear).
M. Tomassini, M. Sipper, M. Zolla, and M. Perrenoud. Generating high-quality random numbers in parallel by cellular automata. Future Generation Computer Systems, 16:291–305, 1999.
S. Wolfram. Cryptography with cellular automata. In Advances in Cryptology: Crypto’ 85 Proceedings, volume 218 of Lecture Notes in Computer Science, pages 429–432. Springer-Verlag, Heidelberg, 1986.
S. Wolfram. Random sequence generation by cellular automata. Advances in Applied Mathematics, 7:123–169, June 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tomassini, M., Perrenoud, M. (2000). Stream Cyphers with One- and Two-Dimensional Cellular Automata. In: Schoenauer, M., et al. Parallel Problem Solving from Nature PPSN VI. PPSN 2000. Lecture Notes in Computer Science, vol 1917. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45356-3_71
Download citation
DOI: https://doi.org/10.1007/3-540-45356-3_71
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41056-0
Online ISBN: 978-3-540-45356-7
eBook Packages: Springer Book Archive