Abstract
We propose a new attack on the self-shrinking generator [8]. The attack is based on a backtracking algorithm and will reconstruct the key from a short sequence of known keystream bits. We give both mathematical and empirical evidence for the effectiveness of this attack. The algorithm takes at most O(20.694L) steps, where L is the key length. Thus, our attack is more efficient than previously known key reconstruction algorithms against the self-shrinking generator that operate on short keystream sequences.
Supported by the LGF Baden-Württemberg
Supported by DFG grant Kr 1521/3-1
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S.R. Blackburn. The linear complexity of the self-shrinking generator. IEEE Transactions on Information Theory, 45(6):2073–2077, September 1999.
D. Coppersmith, H. Krawczyk, and Y. Mansour. The shrinking generator. In D.R. Stinson, editor, Advances in Cryptology-EUROCRYPT’ 93, volume 773 of LNCS, pages 22–39, Berlin, 1993. Springer-Verlag.
J.D. Golić. Cryptanalysis of alleged A5 stream cipher. In W. Fumy, editor, Advances in Cryptology-EUROCRYPT’ 97, volume 1233 of LNCS, pages 239–255, Berlin, 1997. Springer-Verlag.
J.D. Golić and L. O’Connor. Embedding and probabilistic attacks on clock-controlled shift registers. In A. De Santis, editor, Advances in Cryptology-EUROCRYPT’ 94, volume 950 of LNCS, pages 230–243, Berlin, 1995. Springer-Verlag.
S.W. Golomb. Shift Register Sequences. Aegean Park Press, Laguna Hills (CA), revised edition, 1982.
H. Krawczyk. The shrinking generator: Some practical considerations. In R. Andersen, editor, Fast Software Encryption’ 93, volume 809 of LNCS, pages 45–46, Berlin, 1994. Springer-Verlag.
J.L. Massey. Shift register synthesis and BCH decoding. IEEE Transactions on Information Theory, 15:122–127, 1969.
W. Meier and O. Staffelbach. The self-shrinking generator. In A. De Santis, editor, Advances in Cryptology-EUROCRYPT’ 94, volume 950 of LNCS, pages 205–214, Berlin, 1995. Springer-Verlag.
M.J. Mihaljević. A faster cryptanalysis of the self-shrinking generator. In J. Pieprzyk and J. Seberry, editors, Advances in Cryptology-ACISP’ 96, volume 1172 of LNCS, pages 182–189, Berlin, 1996. Springer-Verlag.
I. Shparlinski. On some properties of the shrinking generator. http://www.comp.mq.edu.au/~igor/Shrink.ps.
L. Simpson, J.D. Golić, and E. Dawson. A probabilistic correlation attack on the shrinking generator. In C. Boyd and E. Dawson, editors, Advances in Cryptology-ACISP’ 98, volume 1438 of LNCS, pages 147–158, Berlin, 1998. Springer-Verlag.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zenner, E., Krause, M., Lucks, S. (2001). Improved Cryptanalysis of the Self-Shrinking Generator. In: Varadharajan, V., Mu, Y. (eds) Information Security and Privacy. ACISP 2001. Lecture Notes in Computer Science, vol 2119. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47719-5_4
Download citation
DOI: https://doi.org/10.1007/3-540-47719-5_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42300-3
Online ISBN: 978-3-540-47719-8
eBook Packages: Springer Book Archive