DocumentCode
1721943
Title
Simple cellular automata-based linear models for the shrinking generator
Author
Fuster-Sabater, A. ; de la Guia-Martinez, D.
Author_Institution
Inst. de Fisica Aplicada, CSIC, Madrid, Spain
fYear
2003
Firstpage
143
Lastpage
146
Abstract
Structural properties of two well-known families of keystream generators, shrinking generators and cellular automata, have been analyzed. Emphasis is on the equivalence of the binary sequences obtained from both kinds of generators. In fact, shrinking generators (SG) can be identified with a subset of linear cellular automata (mainly rule 90, rule 150 or a hybrid combination of both rules). The linearity of these cellular models can be advantageously used in the cryptanalysis of those keystream generators.
Keywords
binary sequences; cellular automata; cryptography; random sequences; binary sequences; cryptanalysis; cryptography; equivalence; keystream generators; linear cellular automata; pseudorandom sequences; shrinking generator; Automata; Binary sequences; Character generation; Cryptography; Input variables; Linearity; Polynomials; Random sequences; State feedback;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory Workshop, 2003. Proceedings. 2003 IEEE
Print_ISBN
0-7803-7799-0
Type
conf
DOI
10.1109/ITW.2003.1216715
Filename
1216715
Link To Document