Letter to the editor: A simple linearization of the self-shrinking generator by means of cellular automata

Authors:
Amparo Fúster-Sabater;M. Eugenia Pazo-Robles;Pino Caballero-Gil
Affiliations:
Institute of Applied Physics, CSIC, 144, Serrano 28006 Madrid, Spain;Instituto Tecnológico de Buenos Aires (ITBA), Av. E. Madero 399, C1106ACD Buenos Aires, Argentina;Faculty of Mathematics, DEIOC, University of La Laguna, 38271 Tenerife, Spain
Venue:
Neural Networks
Year:
2010

Citing 5
Cited 0

Introduction to finite fields and their applications

Introduction to finite fields and their applications
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
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

In this work, it is shown that the output sequence of a well-known cryptographic generator, the so-called self-shrinking generator, can be obtained from a simple linear model based on cellular automata. In fact, such a cellular model is a linear version of a nonlinear keystream generator currently used in stream ciphers. The linearization procedure is immediate and is based on the concatenation of a basic structure. The obtained cellular automata can be easily implemented with FPGA logic. Linearity and symmetry properties in such automata can be advantageously exploited for the analysis and/or cryptanalysis of this particular type of sequence generator.