Application of linear hybrid cellular automata to stream ciphers

Authors:
A. Fúster-Sabater;P. Caballero-Gil;M. E. Pazo-Robles
Affiliations:
Instituto de Física Aplicada, C.S.I.C., Madrid, Spain;DEIOC, University of La Laguna, La Laguna, Tenerife, Spain;Instituto de Física Aplicada, C.S.I.C., Madrid, Spain
Venue:
EUROCAST'07 Proceedings of the 11th international conference on Computer aided systems theory
Year:
2007

Citing 8
Cited 2

The shrinking generator

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Shift Register Sequences

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
A highly nonlinear cellular FSM-combiner for stream ciphers

EUROCAST'07 Proceedings of the 11th international conference on Computer aided systems theory
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

Computational complexity of rule distributions of non-uniform cellular automata

LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Local rule distributions, language complexity and non-uniform cellular automata

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Binary sequences generated by a class of linear cellular automata (the so-called multiplicative polynomial cellular automata) can be written as solutions of linear difference equations. At the same time, such solutions equal the output sequences of well known LFSR-based keystream generators. Cryptographic properties of the sequences generated by multiplicative polynomial cellular automata have been analyzed. In addition, an algorithm to model nonlinear LFSR-based generators in terms of these linear automata has been developed.