Abstract
In this paper, we present some major algorithmic improvements to fast correlation attacks. In previous articles about fast correlations, algorithmics never was the main topic. Instead, the authors of these articles were usually addressing theoretical issues in order to get better attacks. This viewpoint has produced a long sequence of increasingly successful attacks against stream ciphers, which share a main common point: the need to find and evaluate parity-checks for the underlying linear feedback shift register. In the present work, we deliberately take a different point of view and we focus on the search for efficient algorithms for finding and evaluating parity-checks. We show that the simple algorithmic techniques that are usually used to perform these steps can be replaced by algorithms with better asymptotic complexity using more advanced algorithmic techniques. In practice, these new algorithms yield large improvements on the efficiency of fast correlation attacks.
Chapter PDF
Similar content being viewed by others
Keywords
References
D. Boneh, A. Joux, and P. Nguyen. Why textbook ElGamal and RSA encryption are insecure. In Proceedings of ASIACRYPT’2000, volume 1976 of Lecture Notes in Computer Science, pages 30–43. Springer, 2000.
A. Canteaut and M. Trabbia. Improved fast correlation attacks using parity-check equations of weight 4 and 5. In Advances in Cryptology-EUROCRYPT’00, volume 1807 of Lecture Notes in Computer Science, pages 573–588. Springer Verlag, 2000.
V. V. Chepyzhov, T. Johansson, and B. Smeets. A simple algorithm for fast correlation attacks on stream ciphers. In Fast Software Encryption-FSE’00, volume 1978 of Lecture Notes in Computer Science. Springer Verlag, 2000.
É. Jaulmes and A. Joux. Cryptanalysis of pkp: a new approach. In Public Key Cryptography 2001, volume 1992 of Lecture Notes in Computer Science, pages 165–172. Springer, 2001.
T. Johansson and F. Jönsson. Fast correlation attacks through reconstruction of linear polynomials. In Advances in Cryptology-CRYPTO’00, volume 1880 of Lecture Notes in Computer Science, pages 300–315. Springer Verlag, 2000.
A. Joux and R. Lercier. “Chinese & Match”, an alternative to atkin’s “Match and Sort” method used in the SEA algorithm. Accepted for publication in Math. Comp., 1999.
W. Meier and O. Staffelbach. Fast correlation attacks on certain stream ciphers. Journal of Cryptology, 1:159–176, 1989.
M. Mihaljević, M. P. C. Fossorier, and H. Imai. A low-complexity and high-performance algorithm for fast correlation attack. In Fast Software Encryption-FSE’00, pages 196–212. Springer Verlag, 2000.
M. Mihaljević, M. P. C. Fossorier, and H. Imai. Fast correlation attack algorithm with list decoding and an application. In Fast Software Encryption-FSE’01, pages 208–222. Springer Verlag, 2001. Pre-proceedings, final proceedings to appear in LNCS.
W. T. Penzhorn and G. J. Kuhn. Computation of low-weight parity checks for correlation attacks on stream ciphers. In Cryptography and Coding-5th IMA Conference, volume 1025 of Lecture Notes in Computer Science, pages 74–83. Springer, 1995.
R. Schroeppel and A. Shamir. A T = O(2n/2), S = O(2n/4) algorithm for certain NP-complete problems. SIAM J. Comput., 10(3):456–464, 1981.
T. Siegenthaler. Correlation-immunity of nonlinear combining functions for cryptographic applications. IEEE Trans. on Information Theory, IT-30:776–780, 1984.
T. Siegenthaler. Decrypting a class of stream ciphers using ciphertext only. IEEE Trans. Comput., C-34:81–85, 1985.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chose, P., Joux, A., Mitton, M. (2002). Fast Correlation Attacks: An Algorithmic Point of View. In: Knudsen, L.R. (eds) Advances in Cryptology — EUROCRYPT 2002. EUROCRYPT 2002. Lecture Notes in Computer Science, vol 2332. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46035-7_14
Download citation
DOI: https://doi.org/10.1007/3-540-46035-7_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43553-2
Online ISBN: 978-3-540-46035-0
eBook Packages: Springer Book Archive