Evolving Collective Behavior of Cellular Automata for Cryptography
Mirosław Szaban, Franciszek Seredyński, Pascal Bouvry · 2006
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