A Low-Complexity and High-Performance Algorithm for the Fast Correlation Attack

  • Miodrag J. Mihaljević
  • Marc P. C. Fossorier
  • Hideki Imai
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1978)


An algorithm for cryptanalysis of certain keystream generators is proposed. The developed algorithm has the following two advantages over other reported ones: (i) it is more powerful and (ii) it provides a high-speed software implementation, as well as a simple hardware one, suitable for high parallel architectures. The novel algorithm is a method for the fast correlation attack with significantly better performance than other reported methods, assuming a lower complexity and the same inputs. The algorithm is based on decoding procedures of the corresponding binary block code with novel constructions of the paritychecks, and the following two decoding approaches are employed: the a posterior probability based threshold decoding and the belief propagation based bit-flipping iterative decoding. These decoding procedures offer good trade-offs between the required sample length, overall complexity and performance. The novel algorithm is compared with recently proposed improved fast correlation attacks based on convolutional codes and turbo decoding. The underlying principles, performance and complexity are compared, and the gain obtained with the novel approach is pointed out.


stream ciphers keystream generators linear feedback shift registers fast correlation attack decoding 


  1. 1.
    L. Bahl, J. Cocke, F. Jelinek and J. Raviv, “Optimal decoding of linear codes for minimizing symbol error rate,” IEEE Transactions on Information Theory, vol. IT-20, pp. 284–287, March 1974.Google Scholar
  2. 2.
    V. Chepyzhov and B. Smeets, “On fast correlation attack on certain stream ciphers”, Advances in Cryptology-EUROCRYPT’ 91, Lecture Notes in Computer Science, vol. 547, pp. 176–185, 1991.Google Scholar
  3. 3.
    A. Clark, J. Dj. Golić, and E. Dawson, “A comparison of fast correlation attacks,” Fast Software Encryption-FSE’96, Lecture Notes in Computer Science, vol. 1039, pp. 145–157, 1996.Google Scholar
  4. 4.
    R. G. Gallager, “Low-density parity-check codes,” IRE Transactions on Information Theory, vol. IT-8, pp. 21–28, Jan. 1962.Google Scholar
  5. 5.
    M. P. C. Fossorier, M. J. Mihaljević and H. Imai, “Reduced complexity iterative decoding of Low Density Parity Check codes based on Belief Propagation”, IEEE Transactions on Communications, vol. 47, pp. 673–680, 1999.CrossRefGoogle Scholar
  6. 6.
    M. P. C. Fossorier, M. J. Mihaljević and H. Imai, “Critical noise for convergence of iterative probabilistic decoding with belief propagation in cryptographic applications”, Applied Algebra, Algebraic Algorithms and Error Correcting Codes-AAECC 13, Lecture Notes in Computer Science, vol. 1719, pp. 282–293, 1999.Google Scholar
  7. 7.
    R. Johannesson and K. Zigangirov, Fundamentals of Convolutional Coding. New York: IEEE Press, 1999.Google Scholar
  8. 8.
    T. Johansson and F. Jonsson, “Improved fast correlation attacks on stream ciphers via convolutional codes”, Advances in Cryptology-EUROCRYPT’99, Lecture No-tes in Computer Science, vol. 1592, pp. 347–362, 1999.Google Scholar
  9. 9.
    T. Johansson and F. Jonsson, “Fast correlation attacks based on turbo code techni-ques”, Advances in Cryptology-CRYPTO’99, Lecture Notes in Computer Science, vol. 1666, pp. 181–197, 1999.Google Scholar
  10. 10.
    J. L. Massey, Threshold Decoding. Cambridge, MA: MIT Press, 1963.Google Scholar
  11. 11.
    A. Menezes, P.C. van Oorschot and S.A. Vanstone, Handbook of Applied Crypto-graphy. Boca Raton: CRC Press, 1997.Google Scholar
  12. 12.
    W. Meier and O. Staffelbach, “Fast correlation attacks on certain stream ciphers,” Journal of Cryptology, vol. 1, pp. 159–176, 1989.zbMATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    M. J. Mihaljević and J. Dj. Golić, “A fast iterative algorithm for a shift register initial state reconstruction given the noisy output sequence”, Advances in Cryptology-AUSCRYPT’ 90, Lecture Notes in Computer Science, vol. 453, pp. 165–175, 1990.Google Scholar
  14. 14.
    M. J. Mihaljević and J. Dj. Golić, “A comparison of cryptanalytic principles based on iterative error-correction,” Advances in Cryptology-EUROCRYPT’ 91, Lecture Notes in Computer Science, vol. 547, pp. 527–531, 1991.Google Scholar
  15. 15.
    M. J. Mihaljević, M.P.C. Fossorier and H. Imai, “Novel fast correlation attack via iterative decoding of punctured simplex code”, Proceedings of IEEE ISIT’2000, Sorento, Italy, June 2000.Google Scholar
  16. 16.
    M. J. Mihaljević and J. Golić, “A method for convergence analysis of iterative probabilistic decoding”, accepted for publication in IEEE Transactions on Information Theory.Google Scholar
  17. 17.
    W. Penzhorn, “Correlation attacks on stream ciphers: Computing low-weight parity checks based on error-correcting codes”, Fast Software Encryption-FSE’96, Lecture Notes in Computer Science, vol. 1039, pp. 159–172, 1996.Google Scholar
  18. 18.
    T. Siegenthaler, “Decrypting a class of stream ciphers using ciphertext only”, IEEE Transactions on Computers, vol. C-34, pp. 81–85, 1985.CrossRefGoogle Scholar
  19. 19.
    K. Zeng and M. Huang, “On the linear syndrome method in cryptanalysis,” Advances in Cryptology-CRYPTO’ 88, Lecture Notes in Computer Science, vol. 403, pp. 469–478, 1990.Google Scholar
  20. 20.
    K. Zeng, C.H. Yang and T.R.N. Rao, “An improved linear syndrome method in cryptanalysis with applications,” Advances in Cryptology-CRYPTO’ 90, Lecture Notes in Computer Science, vol. 537, pp. 34–47, 1991.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Miodrag J. Mihaljević
    • 1
  • Marc P. C. Fossorier
    • 2
  • Hideki Imai
    • 3
  1. 1.Mathematical InstituteSerbian Academy of Science and ArtsBelgradeYugoslavia
  2. 2.Department of Electrical EngineeringUniversity of HawaiiHonoluluUSA
  3. 3.Institute of Industrial ScienceUniversity of TokyoMinato-kuJapan

Personalised recommendations