Linearization of stream ciphers by means of concatenated automata

Authors:
A. Fúster-Sabater;P. Caballero-Gil
Affiliations:
Instituto de Física Aplicada, C.S.I.C., Madrid, Spain;DEIOC, University of La Laguna, La Laguna, Tenerife, Spain
Venue:
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III
Year:
2007

Citing 8
Cited 0

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
Clock-controlled shrinking generator of feedback shift registers

ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Binary sequences generated by a class of linear cellular automata (multiplicative polynomial cellular automata) can be written as solutions of linear difference equations. At the same time, such solutions equal the output sequences from well known LFSR-based stream ciphers. These simple linear automata easily model complex nonlinear cryptographic generators. The modelling technique is based on the concatenation of basic 90/150 cellular automata. Some illustrative examples covering a wide range of cryptographic generators complete the work.