This work shows that a wide class of cryptographic
sequences, the so-called interleaved sequences, can be
generated by means of linear multiplicative polynomial cellular automata. In fact, this type of one-dimensional linear 90/150 cellular automata can be
devised as generators of pseudo-random sequences.
Moreover, these linear automata generate all the solutions of a type of dfference equations with constant
coefficients. Interleaved sequences are just particular
solutions of such equations. In this way, linear discrete models based on cellular automata realize many
popular nonlinear sequence generators of current application in stream ciphers. Thus, cryptographic sequence generators conceived and designed originally
as complex nonlinear models can be easily written in terms of simple linear equivalents.
|Cite as: Fuster-Sabater, A. and Caballero-Gil, P. (2008). Linear Cellular Automata as Discrete Models for Generating Cryptographic Sequences. In Proc. Sixth Australasian Information Security Conference (AISC 2008), Wollongong, NSW, Australia. CRPIT, 81. Brankovic, L. and Miller, M., Eds. ACS. 47-52. |
(local if available)