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
Clock-controlled shrinking generator of feedback shift registers
ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
Theory and applications of q-ary interleaved sequences
IEEE Transactions on Information Theory
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 | 0.01 |
The shrinking generator is a very popular sequence generator with cryptographic applications. Nowadays, it is still considered as a secure keystream generator. In this work, it is shown that the knowledge of only a low number of generated bits is sufficient to break it. Indeed, whereas the linear complexity of the generated sequence (the shrunken sequence) is bounded by A·2(S茂戮驴 2)LC≤ A·2(S茂戮驴 1)(Aand Sbeing the lengths of the two component registers), we claim that the generator can be cryptanalyzed with the knowledge of A·Sintercepted bits and simple computations. Such a result is proven thanks to the definition of the shrunken sequences as a particular kind of interleaved sequences. A similar attack can be extended to any other generator of the class of clock-controlled shrinking generators. 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 sequence generators regarding their use in cryptography.