Abstract
The problem of designing symmetric key cryptography algorithms based upon cellular automata (CAs) is considered. The reliability of the Vernam cipher used in the process of encryption highly depends on a quality of used random numbers. One dimensional, nonuniform CAs is considered as a generator of pseudorandom number sequences (PNSs). The quality of PNSs highly depends on a set of applied CA rules. To find such rules nonuniform CAs with two types of rules is considered. The search of rules is based on an evolutionary technique called cellular programming (CP). Resulting from the collective behavior of the discovered set of CA rules very high quality PNSs are generated. The quality of PNSs outperform the quality of known one dimensional CA-based PNS generators used in secret key cryptography. The extended set of CA rules which was found makes the cryptography system much more resistant on breaking a cryptography key.
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.
Similar content being viewed by others
References
Guan, P.: Cellular Automaton Public-Key Cryptosystem, Complex Systems 1, (1987) 51–56
Gutowitz, H.: Cryptography with Dynamical Systems, in E. Goles and N. Boccara (Eds.) Cellular Automata and Cooperative Phenomena, Kluwer Academic Press, (1993)
Habutsu, T., Nishio, Y., Sasae, I., Mori, S.: A Secret Key Cryptosystem by Iterating a Chaotic Map, Proc. of Eurocrypt’91, (1991) 127–140
Hortensius, P.D., McLeod, R.D., Card H.C.: Parallel random number generation for VLSI systems using cellular automata, IEEE Trans. on Computers 38, (1989) 1466–1473
Kari, J.:, Cryptosystems based on reversible cellular automata, personal communication, (1992)
Knuth, D.E.:, The Art of Computer Programming, vol. 1 & 2, Seminumerical Algorithms, Addison-Wesley, (1981)
Marsaglia, G.: Diehard http://stat.fsu.edu/~geo/diehard.html, (1998)
M. Mitchell, An Introduction to Genetic Algorithms (Complex Adaptive Systems), Publisher: MIT Press, ISBN: 0262133164
Menezes, A., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography, CRC Press, (1996)
Mroczkowski, A.: Application of Cellular Automata in Cryptography, Master Thesis (in Polish), Warsaw University of Technology, (2002)
Nandi, S., Kar, B.K., Chaudhuri, P.P.: Theory and Applications of Cellular Automata in Cryptography, IEEE Trans. on Computers, v. 43, (1994) 1346–1357
National Institute of Standards and Technology, Federal Information Processing Standards Publication 140-2: Security Requirements for Cryptographic Modules, U.S. Government Printing Office, Washington (1999)
Sarkar, P.: A Brief History of Cellular Automata, ACM Computing Surveys, vol. 32, No. 1, (2000) 80–107
Schneier, B.: Applied Cryptography, Wiley, New York, (1996)
Sipper, M., Tomassini, M.: Generating parallel random number generators by cellular programming, Int. Journal of Modern Physics C, 7(2), (1996) 181–190
Tomassini, M., Perrenoud, M.: Stream Ciphers with One-and Two-Dimensional Cellular Automata, in M. Schoenauer at al. (Eds.) Parallel Problem Solving from Nature — PPSN VI, LNCS 1917, Springer, (2000) 722–731
Wolfram, S.: Cryptography with Cellular Automata, in Advances in Cryptology: Crypto’ 85 Proceedings, LNCS 218, Springer, (1986) 429–432
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Seredyński, F., Bouvry, P., Zomaya, A.Y. (2003). Cellular Programming and Symmetric Key Cryptography Systems. In: Cantú-Paz, E., et al. Genetic and Evolutionary Computation — GECCO 2003. GECCO 2003. Lecture Notes in Computer Science, vol 2724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45110-2_11
Download citation
DOI: https://doi.org/10.1007/3-540-45110-2_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40603-7
Online ISBN: 978-3-540-45110-5
eBook Packages: Springer Book Archive