Generating Cryptographic Numbers Using Cellular Automaton
Keywords:
Cellular automata; Cellular programming; Random number generators; Symmetric key; cryptographyAbstract
The paper presents new results concerning application of cellular automata (CAs) to the numbers using
cipher cryptography.CA are applied to generate pseudo-random numbers sequence (PNS) which is used during the
encryption process. One dimensional, non-uniform CAs is considered as a generator of pseudorandom number
sequences (PNSs) used in cryptography with the secret key. The quality of PNSs highly depends on a set of applied CA
rules. Rules of radius r = 1 and 2 for non-uniform one dimensional CAs have been considered. The search of rules is
performed with use of evolutionary technique called cellular programming. As the result of collective behavior of
discovered set of CA rules very high quality PNSs are generated. The quality of PNSs outperforms the quality of known
one dimensional CA-based PNS generators used in the secret key cryptography. The extended set of CA rules which
was found makes the cryptography system much more resistant on breaking a cryptography key.
