 |
    |
Cellular Programming and Symmetric Key Cryptography Systems
Franciszek Seredynski1,2, Pascal Bouvry3, and Albert Y. Zomaya4
1Polish-Japanese Institute of Information Technologies
Koszykowa 86
02-008 Warsaw, Poland
2Institute of Computer Science of Polish Academy of Sciences
Ordona 21
01-237 Warsaw, Poland
sered@ipipan.waw.pl
http://www.ipipan.waw.pl/~sered
3Luxembourg University of Applied Sciences
6, rue Coudenhove Kalergi
L-1359 Luxembourg-Kirchberg, Luxembourg
pascal.bouvry@ist.lu
http://www.ist.lu/users/pascal.bouvry
4School of Information Technologies,University of Sydney
Sydney, NSW 2006 Australia
zomaya@it.usyd.edu.au
http://www.cs.usyd.edu.au/~zomaya
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.
LNCS 2724, p. 1369 ff.
lncs@springer.de
© Springer-Verlag Berlin Heidelberg 2003