High-quality pseudo-random sequence generator based on one-dimensional extended cellular automata
InfoSecu '04 Proceedings of the 3rd international conference on Information security
An one-way function based framework for pairwise key establishment in sensor networks
International Journal of Security and Networks
Secret key specification for a variable-length cryptographic cellular automata model
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part II
Encryption based on reversible second-order cellular automata
ISPA'05 Proceedings of the 2005 international conference on Parallel and Distributed Processing and Applications
| Hi-index | 0.00 |
The paper presents new results concerning application of cellular automata (CAs) to the secret key cryptography. One dimensional, nonuniform 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. To find such rules nonuniform CAs with two types of rules is 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.