Simple Cellular Automata-Based Linear Models for the Shrinking Generator
Preprint
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
All Related Versions
This publication has 6 references indexed in Scilit:
- Analysis of one-dimensional linear hybrid cellular automata over GF(q)IEEE Transactions on Computers, 1996
- Theory and applications of cellular automata in cryptographyIEEE Transactions on Computers, 1994
- Efficient characterisation of cellular automataIEE Proceedings E Computers and Digital Techniques, 1990
- Algebraic properties of cellular automataCommunications in Mathematical Physics, 1984
- Shift-register synthesis and BCH decodingIEEE Transactions on Information Theory, 1969
- Theory of transformation groups of polynomials over GF(2) with applications to linear shift register sequencesInformation Sciences, 1968