Skip to main content
SpringerLink
Log in
Book cover

Cryptographers’ Track at the RSA Conference

CT-RSA 2005: Topics in Cryptology – CT-RSA 2005 pp 72–86Cite as

A Fast Correlation Attack on the Shrinking Generator

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 3376))

Abstract

In this paper we demonstrate a fast correlation attack on the shrinking generator with known connections. Our attack is applicable to arbitrary weight feedback polynomial of the generating LFSR and comparisons with other known attacks show that our attack offers good trade-offs between required keystream length, success probability and complexity. Our result confirms Golić’s conjecture that the shrinking generator may be vulnerable to fast correlation attacks without exhaustively searching through all possible initial states of some LFSR is correct.

Supported by National Natural Science Foundation of China (Grant No. 60273027), National Key Foundation Research 973 project (Grant No. G1999035802) and National Science Fund for Distinguished Young Scholars (Grant No. 60025205).

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Biryukov, A.: Block Ciphers and Stream Ciphers: The State of the Art, http://eprint.iacr.org/2004/094.pdf

  2. Canteaut, A., Trabbia, M.: Improved Fast Correlation Attacks Using Parity-Check Equations of Weight 4 and 5. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 573–588. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  3. Chose, P., Joux, A., Mitton, M.: Fast Correlation Attacks: An Algorithmic Point of View. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 209–221. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  4. Coppersmith, D., Krawczyk, H., Mansour, Y.: The shrinking generator. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 22–39. Springer, Heidelberg (1994)

    Google Scholar 

  5. Ekdahl, P., Johansson, T.: Predicting the Shrinking Generator with Fixed Connections. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 330–344. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  6. Golić, J.D.: Correlation analysis of the shrinking generator. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 440–457. Springer, Heidelberg (2001)

    Google Scholar 

  7. Golić, J.D.: Computation of Low-weight parity-check ploynomials. Electronic Letters 32(21), 1981–1982 (1996)

    Article  Google Scholar 

  8. Golić, J.D.: Embedding and probabilistic correlation attacks on clock-controlled shift registers. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 230–243. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  9. Krawczyk, H.: The shrinking generator: Some practical considerations. In: Anderson, R. (ed.) FSE 1993. LNCS, vol. 809, pp. 45–46. Springer, Heidelberg (1994)

    Google Scholar 

  10. Johansson, T., Jönsson, F.: Improved fast correlation attacks on stream ciphers via convolutional codes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 347–362. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  11. Johansson, T., Jönsson, F.: Fast correlation attacks through reconstruction of linear polynomials. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 300–315. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  12. Johansson, T.: Reduced complexity correlation attacks on two clock-controlled generators. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol. 1514, pp. 342–357. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  13. Menezes, A., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1997)

    MATH  Google Scholar 

  14. Meier, W., Staffelbach, O.: Fast correlation attacks on certain stream ciphers. Journal of Cryptology 1, 159–176 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  15. Mihaljević, M.J., Fossorier, M.P.C., Imai, H.: Fast correlation attack algorithm with list decoding and an application. In: Matsui, M. (ed.) FSE 2001. LNCS, vol. 2355, pp. 196–210. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  16. Mihaljević, M., Fossorier, P.C., Imai, H.: A Low-complexity and high-performance algorithm for fast correlation attack. In: Schneier, B. (ed.) FSE 2000. LNCS, vol. 1978, pp. 196–212. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  17. Molland, H.: Improved linear consistency attack on irregular clocked keystream generators. In: Roy, B., Meier, W. (eds.) FSE 2004. LNCS, vol. 3017, pp. 109–126. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  18. Noorkami, M., Fekri, F.: A fast correlation attack via unequal error correcting LDPC codes. In: Okamoto, T. (ed.) CT-RSA 2004. LNCS, vol. 2964, pp. 54–66. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  19. Simpson, L., Golić, D.J.: A probabilistic correlation attack on the shrinking generator. In: Boyd, C., Dawson, E. (eds.) ACISP 1998. LNCS, vol. 1438, pp. 147–158. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  20. Wagner, D.: A generalized birthday problem. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 288–303. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  21. Zhang, D.F., Chen, W.D.: Information Leak analysing on the Shrinking Generator and the Self-Shrinking Generator. Journal of China Institute of Communications 17(4), 15–20 (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Infocomm Research, Singapore

    Bin Zhang, Hongjun Wu & Feng Bao

  2. State Key Laboratory of Information Security, Graduate School of the Chinese Academy of Sciences, Beijing, 100039, P. R. China

    Bin Zhang & Dengguo Feng

Authors
  1. Bin Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hongjun Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dengguo Feng
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Feng Bao
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Combinatorics & Optimization, University of Waterloo,  

    Alfred Menezes

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, B., Wu, H., Feng, D., Bao, F. (2005). A Fast Correlation Attack on the Shrinking Generator. In: Menezes, A. (eds) Topics in Cryptology – CT-RSA 2005. CT-RSA 2005. Lecture Notes in Computer Science, vol 3376. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30574-3_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30574-3_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24399-1

  • Online ISBN: 978-3-540-30574-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation