Cellular automata computations and secret key cryptography

摘要

In this paper, cellular automata (CAs) are used to design a symmetric key cryptography system based on Vernam cipher. CAs are applied to generate a pseudo-random numbers sequence (PNS) which is used during the encryption process. The quality of PNSs highly depends on the set of applied CA rules. Rules of radius r = 1 and 2 for nonuniform one-dimensional CAs have been considered. A new set of rules has been discovered using an evolutionary technique called cellular programming. This set provides very high quality encryption, and the system is very resistant to attempts of breaking the cryptography key.