Application of Linear Hybrid Cellular Automata to Stream Ciphers

摘要

Binary sequences generated by a class of linear cellular automata (the so-called multiplicative polynomial cellular automata) can be written as solutions of linear difference equations. At the same time, such solutions equal the output sequences of well known LFSR-based keystream generators. Cryptographic properties of the sequences generated by multiplicative polynomial cellular automata have been analyzed. In addition, an algorithm to model nonlinear LFSR-based generators in terms of these linear automata has been developed.