Advertisement

Multi-pass Fast Correlation Attack on Stream Ciphers

  • Bin Zhang
  • Dengguo Feng
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4356)

Abstract

Fast correlation attacks are one of the most important attacks against stream ciphers. Previous results on this topic mainly regard the initial state of the involved linear feedback shift register as a whole and only use one sort of parity-checks to decode the corresponding linear code. In this paper we propose a new kind of attack, called multi-pass fast correlation attack, on stream ciphers. This kind of attack can make good use of different kinds of parity-checks without increasing the asymptotic complexity and restore the initial state part-by-part. It has no restriction on the weight of the underlying linear feedback shift register and both theoretical analysis and simulation results show that it is more efficient than all the previously known fast correlation attacks.

Keywords

Stream cipher Fast correlation attack Linear feedback shift register (LFSR) Parity-check 

References

  1. 1.
    Armknecht, F., Krause, M.: Algebraic Attacks on Combiners with Memory. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 162–175. Springer, Heidelberg (2003)Google Scholar
  2. 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)CrossRefGoogle Scholar
  3. 3.
    Chepyzhov, V.V., Johansson, T., Smeets, B.: A Simple Algorithm for Fast Correlation Attacks on Stream Ciphers. In: Schneier, B. (ed.) FSE 2000. LNCS, vol. 1978, pp. 181–195. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  4. 4.
    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)CrossRefGoogle Scholar
  5. 5.
    Clark, A., Dawson, E., Fuller, J., Golić, J., et al.: The LILI-128 Keystream Generator. In: Stinson, D.R., Tavares, S. (eds.) SAC 2000. LNCS, vol. 2012, pp. 22–39. Springer, Heidelberg (2001)Google Scholar
  6. 6.
    Courtois, N.T., Meier, W.: Algebraic Attacks on Stream Ciphers with Linear Feedback. In: Biham, E. (ed.) Advances in Cryptology – EUROCRPYT 2003. LNCS, vol. 2656, pp. 345–359. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  7. 7.
    Courtois, N.T.: Fast Algebraic Attacks on Stream Ciphers with Linear Feedback. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 176–194. Springer, Heidelberg (2003)Google Scholar
  8. 8.
    Golić, J.D.: Computation of low-weight parity-check polynomials. Electronic Letters 32(21), 1981–1982 (1996)CrossRefGoogle Scholar
  9. 9.
    Golić, J.D., Salmasizadeh, M. (ed.): Dawson, Fast correlation attacks on the summation generator. Journal of Cryptology, Springer-Verlag, vol. 13, pp. 245–262 (2000)Google Scholar
  10. 10.
    Golić, J.D.: Iterative optimum symbol-by-symbol decoding and fast correlation attack. IEEE Trans. Inform. Theory 47, 3040–3049 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Golić, J.D., Hawkes, P.: Vetorial appraoch to fast correlation attacks. Designs, Codes and Cryptography 35, 5–19 (2005)CrossRefGoogle Scholar
  12. 12.
    Golić, J.D.: Linear cryptanalysis of bluetooth stream cipher. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 51–74. Springer, Heidelberg (2002)Google Scholar
  13. 13.
    Karpovsky, M.: Finite Orthogonal Series in the Design of Diginal Devices. John Wiley and Sons, New York (1976)Google Scholar
  14. 14.
    Johansson, T., Jösson, F.: Fast Correlation Attacks based on turbo code techniques. In: Wiener, M.J. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 181–197. Springer, Heidelberg (1999)Google Scholar
  15. 15.
    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)CrossRefGoogle Scholar
  16. 16.
    Johansson, T., Jösson, 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)Google Scholar
  17. 17.
    Johansson, T., Jösson, F.: Fast Correlation Attacks through reconstruction of linear polynomals. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 300–315. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  18. 18.
    Johansson, T., Jösson, F.: A Fast Correlation Attack on LILI-128. Information Processing Letters 81, 127–132 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  19. 19.
    Lu, Y., Vaudenay, S.: Faster Correlation Attack on Bluetooth Keystream Generator E0. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 407–425. Springer, Heidelberg (2004)Google Scholar
  20. 20.
    Matsui, M.: Linear Cryptanalysis Method for DES Cipher. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 386–397. Springer, Heidelberg (1994)Google Scholar
  21. 21.
    Meier, W., Staffelbach, O.: Fast Correlation Attacks on certain stream ciphers. Journal of Cryptology, 159–176 (1989)Google Scholar
  22. 22.
    Menezes, A.J., Van Orschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC, Boca Raton (1996)Google Scholar
  23. 23.
    Mihaljević, M., Fossorier, M.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)CrossRefGoogle Scholar
  24. 24.
    Mihaljević, M., Fossorier, M.P.C., Imai, H.: Fast Correlation Attack Algorithm with listing decoding and an application. In: Matsui, M. (ed.) FSE 2001. LNCS, vol. 2355, pp. 208–222. Springer, Heidelberg (2002)Google Scholar
  25. 25.
    Molland, H., Helleseth, T.: An Improved Correlation Attack Against Irregular Clocked and Filtered Keystream Generators. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 373–389. Springer, Heidelberg (2004)Google Scholar
  26. 26.
    Siegenthaler, T.: Decrypting a Class of Stream Ciphers using ciphertext only. IEEE Transactions on Computer C-34, 81–85 (1985)CrossRefGoogle Scholar
  27. 27.
    Wagner, D.: A Generalized Birthday Problem. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 288–304. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  28. 28.
    Yarlagadda, R.K., Hershey, J.E.: Hadamard Matrix Analysis and Synthesis with Applications to Communications and Signal/Image Processing, pp. 17–22. Kluwer Academic, Dordrecht (1997)Google Scholar
  29. 29.
    Zhang, B., Wu, H., Feng, D., Bao, F.: A Fast Correlation attack on the shrinking generator. In: Menezes, A.J. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 72–86. Springer, Heidelberg (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Bin Zhang
    • 1
  • Dengguo Feng
    • 1
  1. 1.State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences, Beijing 100080P.R. China

Personalised recommendations