Introduction to finite fields and their applications
Introduction to finite fields and their applications
Random sequence generation by cellular automata
Advances in Applied Mathematics
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Shift Register Sequences
A wide family of nonlinear filter functions with a large linear span
Information Sciences—Informatics and Computer Science: An International Journal
Theory of cellular automata: a survey
Theoretical Computer Science
Concatenated automata in cryptanalysis of stream ciphers
ACRI'06 Proceedings of the 7th international conference on Cellular Automata for Research and Industry
Theory and applications of q-ary interleaved sequences
IEEE Transactions on Information Theory
Synthesis of one-dimensional linear hybrid cellular automata
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
| Hi-index | 0.00 |
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 difference 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.