Searching for efficient cellular automata based keys applied in symmetric key cryptography
Mirosław Szaban, Franciszek Seredyński · Studia Iuridica Lublinensia (Uniwersytet Marii Curie-Skłodowskiej w Lublinie) · 2007
In this paper we consider a problem of generation by cellular automata of high qualitypseudorandom sequences useful in cryptography. For this purpose one dimensional nonuniformcellular automata is used. The quality of pseudorandom sequences generated by cellular automatadepends on collective behavior of rules assigned to the cellular automata cells. Genetic algorithmis used to find suitable rules from the earlier predefined set of rules. It has been shown that geneticalgorithm eliminates bad subsets of rules and finds subsets of rules, which provide high qualitypseudorandom sequences. These sequences are suitable for symmetric key cryptography and canbe used in different cryptographic modules.