Abstract
We propose a novel distinguishing attack on the shrinking generator with known feedback polynomial for the generating LFSR. The attack can e.g. reliably distinguish a shrinking generator with a weight 4 polynomial of degree as large as 10000, using 232 output bits. As the feedback polynomial of an arbitrary LFSR is known to have a polynomial multiple of low weight, our distinguisher applies to arbitrary shrunken LFSR’s of moderate length. The analysis can also be used to predict the distribution of blocks in the generated keystream.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
A. Canteaut, M. Trabbia, “Improved Fast Correlation Attacks Using Parity-Check Equations of Weight 4 and 5”, Advances in Cryptology — EUROCRYPT 2000, LNCS vol 1807, Springer-Verlag, 2000, pp. 573–588.
D. Coppersmith, S. Halevi, C. Jutla, “Cryptanalysis of stream ciphers with linear masking”, Advances in Cryptology — CRYPTO 2002, LNCS vol 2442, Springer, 2002, pp 515–532.
D. Coppersmith, H. Krawczyk, Y. Mansour, “The Shrinking Generator”, Advances in Cryptology — Crypto’93, LNCS vol 773, Springer-Verlag, 1994, pp 22–39.
T. Cover, J. Thomas, Elements of Information Theory, Wiley series in telecommunications, Wiley-interscience, 1991.
P. Ekdahl, T. Johansson, “Distinguishing attacks on SOBER”, Fast Software Encryption (FSE) 2002, LNCS vol 2365, Springer 2002, 210–224.
J. Dj. Golić, L. O’Connor, “Embedding and probabilistic correlation attacks on clock-controlled shift registers”, Advances in Cryptology — EUROCRYPT’94, LNCS vol 950, Springer-Verlag, 1995, pp. 230–243.
J. Dj. Golić, “Towards Fast Correlation Attacks on Irregularly Clocked Shift Registers”, Advances in Cryptology — EUROCRYPT’95, LNCS vol 921, Springer-Verlag, 1995, pp. 248–262.
J. Dj. Golić, “Linear Models for Keystream Generators”, IEEE Trans. on Computers, vol 45, No 1 January, IEEE Press, 1996, pp. 41–49.
J. Dj. Golić, “Computation of low-weight parity-check polynomials”, Electronic Letters, Vol. 32, No 21 October, 1996.
J. Dj. Golić, “Correlation analysis of the Shrinking Generator”, Advances in Cryptology — CRYPTO 2001, LNCS vol 2139, Springer-Verlag, 2001, pp. 440–457.
R. Johannesson, K. Sh. Zigangirov, Fundamentals of convolutional coding, IEEE Series on digital and mobile communication, IEEE Press, 1999, p 5.
T. Johansson, “Reduced complexity correlation attacks on two clock-controlled generators”, Advances in Cryptology — ASIACRYPT’98, LNCS vol 1514, Springer-Verlag, 1998, pp. 342–357.
T. Johansson, F. Jönsson, “Fast Correlation Attacks Through Reconstruction of Linear Polynomials”, Advances in Cryptology — CRYPTO 2000, LNCS vol 1880, Springer-Verlag, 2000, pp. 300–315.
M. Matsui, “Linear cryptanalysis method for DES cipher, Andvances in Cryptology — EUROCRYPT’93, LNCS vol 765, Springer-Verlag, 1994, pp. 386–397.
A. Menezes, P. van Oorschot, S. Vanstone, Handbook of Applied Cryptography, CRC Press, 1997.
L. Simpson, J. Dj. Golić, E. Dawson, “A probabilistic correlation attack on the shrinking generator”, Information Security and Privacy’98 — Brisbane, LNCS vol 1438, Springer-Verlag, 1998, pp. 147–158.
D. Wagner, “A Generalized Birthday Problem”, Advances in Cryptology — CRYPTO 2002, LNCS vol 2442, Springer-Verlag, 2002, pp. 288–303.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 International Association for Cryptologic Research
About this paper
Cite this paper
Ekdahl, P., Meier, W., Johansson, T. (2003). Predicting the Shrinking Generator with Fixed Connections. In: Biham, E. (eds) Advances in Cryptology — EUROCRYPT 2003. EUROCRYPT 2003. Lecture Notes in Computer Science, vol 2656. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39200-9_20
Download citation
DOI: https://doi.org/10.1007/3-540-39200-9_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-14039-9
Online ISBN: 978-3-540-39200-2
eBook Packages: Springer Book Archive