论文信息 - Evolving collective behavior of cellular automata for cryptography

Evolving collective behavior of cellular automata for cryptography

We consider 1D cellular automata (CA) and apply genetic algorithm (GA) to discover subsets of rules controlling CA cells, which collective behavior results in a high quality of pseudorandom number sequences (PNSs) suitable for symmetric key cryptography. The search of subsets of rules is performed in a set of predefined rules. We discover new subsets of CA rules providing very high quality of PNSs, which can be used in cryptographic modules

[1] Stephen Wolfram. Cryptography with Cellular Automata , 1985, CRYPTO.

[2] Puhua Guan,et al. Cellular Automaton Public-Key Cryptosystem , 1987, Complex Syst..

[3] Iwao Sasase,et al. A Secret Key Cryptosystem by Iterating a Chaotic Map , 1991, EUROCRYPT.

[4] Jarkko Kari. Cryptosystems Based on Reversible Cellular Automata , 1992 .

[5] Zbigniew Michalewicz,et al. Genetic Algorithms + Data Structures = Evolution Programs , 1992, Artificial Intelligence.

[6] Howard Gutowitz,et al. Cryptography with Dynamical Systems , 1993 .

[7] Parimal Pal Chaudhuri,et al. Theory and Applications of Cellular Automata in Cryptography , 1994, IEEE Trans. Computers.

[8] Zbigniew Michalewicz,et al. Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[9] Alfred Menezes,et al. Handbook of Applied Cryptography , 2018 .

[10] Marco Tomassini,et al. On the Generation of High-Quality Random Numbers by Two-Dimensional Cellular Automata , 2000, IEEE Trans. Computers.

[11] Marco Tomassini,et al. Stream Cyphers with One- and Two-Dimensional Cellular Automata , 2000, PPSN.

[12] Marco Tomassini,et al. Cryptography with cellular automata , 2001, Appl. Soft Comput..

[13] Albert Y. Zomaya,et al. Cellular automata computations and secret key cryptography , 2004, Parallel Comput..

[14] Pascal Bouvry,et al. Weak Key Analysis and Micro-controller Implementation of CA Stream Ciphers , 2005, KES.