Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
Book cover

International Conference on the Theory and Applications of Cryptographic Techniques

EUROCRYPT 2003: Advances in Cryptology — EUROCRYPT 2003 pp 330–344Cite as

  1. Home
  2. Advances in Cryptology — EUROCRYPT 2003
  3. Conference paper
Predicting the Shrinking Generator with Fixed Connections

Predicting the Shrinking Generator with Fixed Connections

  • Patrik Ekdahl5,
  • Willi Meier6 &
  • Thomas Johansson5 
  • Conference paper
  • First Online: 01 January 2003
  • 3412 Accesses

  • 19 Citations

Part of the Lecture Notes in Computer Science book series (LNCS,volume 2656)

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.

Keywords

  • Stream Cipher
  • Correlation Attack
  • Sequence Generate
  • Linear Recursion
  • Distinguishing Attack

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.

Download conference paper PDF

References

  1. 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.

    CrossRef  Google Scholar 

  2. 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.

    Google Scholar 

  3. D. Coppersmith, H. Krawczyk, Y. Mansour, “The Shrinking Generator”, Advances in Cryptology — Crypto’93, LNCS vol 773, Springer-Verlag, 1994, pp 22–39.

    Google Scholar 

  4. T. Cover, J. Thomas, Elements of Information Theory, Wiley series in telecommunications, Wiley-interscience, 1991.

    Google Scholar 

  5. P. Ekdahl, T. Johansson, “Distinguishing attacks on SOBER”, Fast Software Encryption (FSE) 2002, LNCS vol 2365, Springer 2002, 210–224.

    CrossRef  Google Scholar 

  6. 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.

    CrossRef  Google Scholar 

  7. 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.

    Google Scholar 

  8. J. Dj. Golić, “Linear Models for Keystream Generators”, IEEE Trans. on Computers, vol 45, No 1 January, IEEE Press, 1996, pp. 41–49.

    CrossRef  MATH  Google Scholar 

  9. J. Dj. Golić, “Computation of low-weight parity-check polynomials”, Electronic Letters, Vol. 32, No 21 October, 1996.

    Google Scholar 

  10. J. Dj. Golić, “Correlation analysis of the Shrinking Generator”, Advances in Cryptology — CRYPTO 2001, LNCS vol 2139, Springer-Verlag, 2001, pp. 440–457.

    Google Scholar 

  11. R. Johannesson, K. Sh. Zigangirov, Fundamentals of convolutional coding, IEEE Series on digital and mobile communication, IEEE Press, 1999, p 5.

    Google Scholar 

  12. 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.

    CrossRef  Google Scholar 

  13. 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.

    Google Scholar 

  14. M. Matsui, “Linear cryptanalysis method for DES cipher, Andvances in Cryptology — EUROCRYPT’93, LNCS vol 765, Springer-Verlag, 1994, pp. 386–397.

    Google Scholar 

  15. A. Menezes, P. van Oorschot, S. Vanstone, Handbook of Applied Cryptography, CRC Press, 1997.

    Google Scholar 

  16. 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.

    Google Scholar 

  17. D. Wagner, “A Generalized Birthday Problem”, Advances in Cryptology — CRYPTO 2002, LNCS vol 2442, Springer-Verlag, 2002, pp. 288–303.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Information Technology, Lund University, P.O. Box 118, SE-221 00, Lund, Sweden

    Patrik Ekdahl & Thomas Johansson

  2. FH Aargau, CH-5210, Windisch, Switzerland

    Willi Meier

Authors
  1. Patrik Ekdahl
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Willi Meier
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Thomas Johansson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department, Technion — Israel Institute of Technology, Haifa, 32000, Israel

    Eli Biham

Rights and permissions

Reprints 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

  • .RIS
  • .ENW
  • .BIB
  • DOI: https://doi.org/10.1007/3-540-39200-9_20

  • Published: 13 May 2003

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-14039-9

  • Online ISBN: 978-3-540-39200-2

  • eBook Packages: Springer Book Archive

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature