#### Filter Results:

#### Publication Year

2006

2011

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

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… (More)

This work shows that the cryptanalysis of the shrinking generator requires fewer intercepted bits than that indicated by the linear complexity. Indeed, whereas the linear complexity of shrunken sequences is between A·2 (S−2) and A·2 (S−1) , we claim that the initial states of both component registers are easily computed with less than A · S shrunken bits.… (More)

A new class of linear sequence generators based on cellular automata is here introduced in order to model several nonlinear keystream generators with practical applications in symmetric cryptography. The output sequences are written as solutions of linear difference equations, and three basic properties (period, linear complexity and number of different… (More)

- ‹
- 1
- ›