On the Use of Linear Cellular Automata for the Synthesis of Cryptographic Sequences

* Final gross prices may vary according to local VAT.

Get Access


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.