Simple Cellular Automata-Based Linear Models for the Shrinking Generator

Details Simple Cellular Automata-Based Linear Models for the Shrinking Generator Simple Cellular Automata-Based Linear Models for the Shrinking Generator

2010-06-09

arxiv.org/abs/1006.1755v1

Computer Science

Cryptography and Security

10 pages, 0 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Simple Cellular Automata-Based Linear Models for the Shrinking Generator does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Simple Cellular Automata-Based Linear Models for the Shrinking Generator, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Simple Cellular Automata-Based Linear Models for the Shrinking Generator will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-39599