2021-04-23T07:21:23Z
http://digital.csic.es/dspace-oai/request
oai:digital.csic.es:10261/11021
2016-02-16T04:32:05Z
com_10261_113
com_10261_4
col_10261_492
http://hdl.handle.net/10261/11021
10231
Linear Cellular Automata as Discrete Models for Generating Cryptographic Sequences
Australian Computer Society
2008
Fúster Sabater, Amparo
Caballero Gil, Pino
Interleaved sequence
Cellular automata
Linearization
Stream ciphers
Cryptography
2008
6 pages, 5 tables.-- This paper appeared at the Australasian Information Security Conference (AISC2008), Wollongong, Australia, January 2008.-- Later published as paper: http://digital.csic.es/handle/10261/11004
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.
openAccess
Proc. Sixth Australasian Information Security Conference