Cryptography based upon Cellular Automata

• Autorzy: Seredyński F. , Bouvry P. , Szaban M.
• Języki publikacji: EN

Abstrakty

EN

New results concerning application of cellular automata (CAs) to secret key cryptography is described in this paper. One dimensional nonuniform CAs are considered for generating pseudorandom number sequences used in a secret key cryptographic system. The quality of PNSs highly depends on set of applied CA rules. The search of rules relies on an evolutionary technique called cellular programming. Different rule sizes are considered. As the result of collective behavior of discovered set of CA rules very high quality PNSs are generated. Indeed the quality of PNSs outerforms the quality of known one dimensional CA-based PNS generators used for secret key cryptography. The extended set of CA rules proposed in this article makes the cryptography system much more resistant on attacks.

Słowa kluczowe

EN

cellular automata; CA; secret key cryptography; extended set of CA rules

• Wydawca: Wydawnictwo Uniwersytetu Przyrodniczo-Humanistycznego w Siedlcach
• Czasopismo: Studia Informatica : systems and information technology
• Rocznik: 2003
• Tom: Vol. 2(2)
• Strony: 73--85
• Opis fizyczny: Bibliogr. 17 poz., rys., tab., wykr.

Twórcy

autor

Seredyński F.

• The University of Podlasie, Computer Science Department, Sienkiewicza 51, 08-110 Siedlce, Poland
• Institute of Computer Science, Polish Academy of Sciences, Ordona 21, 01-237 Warsaw, Poland

autor

Bouvry P.

• Faculty of Sciences, Technology and Communication, Luxemburg University, 6, rue Coudenhove Kalergi, L-1359 Luxemburg-Kirchberg, Luxemburg

autor

Szaban M.

• The University of Podlasie, Computer Science Department, Sienkiewicza 51, 08-110 Siedlce, Poland

Bibliografia

• [1] P. Guan, Cellular Automaton Public-Key Cryptosystem, Complex Systems 1, 1987, pp. 51-56.
• [2] H. Gutowitz, Cryptography with Dynamical Systems, in E. Goles and N. Boccara (Eds.) Cellular Automata and Cooperative Phenomena, Kluwer Academic Press, 1993.
• [3] T. Habutsu, Y. Nishio, I. Sasae, and S. Mori, A Secret Key Cryptosystem by Iterating a Chaotic Map, Proc. of Eurocrypt’91, 1991, pp. 127-140.
• [4] P. D. Hortensius, R. D. McLeod, and H. C. Card, Parallel random number generation for VLSI systems using cellular automata, IEEE Trans, on Computers 38, October 1989, pp. 1466-1473.
• [5] J. Kari, Cryptosystems based on reversible cellular automata, personal communication, 1992.
• [6] D. E. Knuth, The Art of Computer Programming, vol. 1 & 2, Seminumerical Algorithms, Addison-Wesley, 1981.
• [7] G. Marsaglia, Diehard http://stat.fsu.edu/7geo/diehard.html, 1998.
• [8] A. Menezes, P. van Oorschot, and S. Vanstone, Handbook of Applied Cryptography, CRC Press, 1996.
• [9] A. Mroczkowski, Application of Cellular Automata in Cryptography, Master Thesis (in Polish), Warsaw University of Technology, 2002.
• [10] S. Nandi, B. K. Kar, and P. P. Chaudhuri, Theory and Applications of Cellular Automata in Cryptography, IEEE Trans, on Computers, v. 43, December 1994, pp. 1346-1357.
• [11] 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.
• [12] F. Seredynski, P. Bouvry, A. Y. Zomaya, Cellular Programming and Symmetric Key Cryptography Systems, in E. Cantu-Paz et al. (Eds.), Genetic and Evolutionary Computation-GECCO 2003, LNCS 2724, Springer, pp. 1369-1381.
• [13] B. Schneier, Applied Cryptography, Wiley, New York, 1996.
• [14] M. Sipper and M. Tomassini, Generating parallel random number generators by cellular programming, Int. Journal of Modern Physics C, 7(2), 1996, pp. 181-190.
• [15] M. Tomassini and M. Perrenoud, 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, pp. 722-731.
• [16] M. Tomassini and M. Sipper, On the Generation of High-Quality Random Numbers by Two-Dimensional Cellular Automata, IEEE Trans, on Com- puters, v. 49, No. 10, October 2000, pp. 1140-1151.
• [17] S. Wolfram, Cryptography with Cellular Automata, in Advances in Cryptology: Crypto’85 Proceedings, LNCS 218, Springer, 1986, pp. 429-432.