On the Use of Linear Cellular Automata for the Synthesis of Cryptographic Sequences
- Cite this paper as:
- Fúster-Sabater A., Caballero-Gil P., Delgado O. (2008) On the Use of Linear Cellular Automata for the Synthesis of Cryptographic Sequences. In: Corchado E., Abraham A., Pedrycz W. (eds) Hybrid Artificial Intelligence Systems. HAIS 2008. Lecture Notes in Computer Science, vol 5271. Springer, Berlin, Heidelberg
This work shows that a class of cryptographic sequences, the so-called interleaved sequences, can be generated by means of linear hybrid cellular automata. More precisely, linear multiplicative polynomial cellular automata generate all the components of this family of interleaved sequences. As an illustrative example, the linearization procedure of the self-shrinking generator is described. In this way, popular nonlinear sequence generators with cryptographic application are linearized in terms of simple cellular automata.
Keywordsinterleaved sequence linear cellular automata self-shrinking generator cryptography
Unable to display preview. Download preview PDF.