Introduction to finite fields and their applications
Introduction to finite fields and their applications
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
On Some Properties of the Shrinking Generator
Designs, Codes and Cryptography
Shift Register Sequences
A Probabilistic Correlation Attack on the Shrinking Generator
ACISP '98 Proceedings of the Third Australasian Conference on Information Security and Privacy
A wide family of nonlinear filter functions with a large linear span
Information Sciences—Informatics and Computer Science: An International Journal
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Multiplexed sequences: some properties of the minimum polynomial
Proceedings of the 1982 conference on Cryptography
Theory and applications of q-ary interleaved sequences
IEEE Transactions on Information Theory
Clock-controlled shift registers: a review
IEEE Journal on Selected Areas in Communications
Analysis of the generalized self-shrinking generator
Computers & Mathematics with Applications
Cryptanalytic attack on the self-shrinking sequence generator
ICANNGA'11 Proceedings of the 10th international conference on Adaptive and natural computing algorithms - Volume Part II
Structural properties of cryptographic sequences
CISIS'11 Proceedings of the 4th international conference on Computational intelligence in security for information systems
Generation of pseudorandom binary sequences with controllable cryptographic parameters
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part I
On the linearity of cryptographic sequence generators
ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part II
| Hi-index | 5.23 |
The shrinking generator is a simple keystream generator with applications in stream ciphers, which is still considered as a secure generator. This work shows that, in order to cryptanalyze it, fewer intercepted bits than indicated by the linear complexity are necessary. 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 fewer than A@?S shrunken bits located at particular positions. Such a result is proven thanks to the definition of shrunken sequences as interleaved sequences. Consequently, it is conjectured that this statement can be extended to all interleaved sequences. Furthermore, this paper confirms that certain bits of the interleaved sequences have a greater strategic importance than others, which must be considered as a proof of weakness of interleaved generators.