Abstract
The task of a fast correlation attack is to efficiently restore the initial content of a linear feedback shift register in a stream cipher using a detected correlation with the output sequence. We show that by modeling this problem as the problem of learning a binary linear multivariate polynomial, algorithms for polynomial reconstruction with queries can be modified through some general techniques used in fast correlation attacks. The result is a new and efficient way of performing fast correlation attacks.
Chapter PDF
Similar content being viewed by others
References
A. Blum, M. Furst, M. Kearns, R. Lipton, “Cryptographic primitives based on hard learning problems”, Advances in Cryptology-CRYPTO’93, Lecture Notes in Computer Science, vol. 773, Springer-Verlag, 1993, pp. 278–291.
A. Canteaut, M. Trabbia, “Improved fast correlation attacks using parity-check equations of weight 4 and 5”, Advances in Cryptology-EUROCRYPT’2000, Lecture Notes in Computer Science, vol. 1807, Springer-Verlag, 2000, pp. 573–588.
V. Chepyzhov, T. Johansson, and B. Smeets, “A simple algorithm for fast correlation attacks on stream ciphers”, Fast Software Encryption, FSE’2000, to appear in Lecture Notes in Computer Science, Springer-Verlag, 2000.
V. Chepyzhov, and B. Smeets, “On a fast correlation attack on certain stream ciphers”, In Advances in Cryptology-EUROCRYPT’91, Lecture Notes in Computer Science, vol. 547, Springer-Verlag, 1991, pp. 176–185. Fast Correlation Attacks through Reconstruction of Linear Polynomials
A. Clark, J. Golic, E. Dawson, “A comparison of fast correlation attacks”, Fast Software Encryption, FSE’96, Lecture Notes in Computer Science, Springer-Verlag, vol. 1039, 1996, pp. 145–158.
O. Goldreich and L.A. Levin, “A hard-core predicate for all one-way functions”, Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, Seattle, Washington, 15–17 May 1989, pp. 25–32.
O. Goldreich, R. Rubinfeld, M. Sudan, “Learning polynomials with queries: The highly noisy caser”, 36th Annual Symposium on Foundation of Computer Science, Milwaukee, Wisconsin, 23–25 October 1995, pp. 294–303.
T. Jakobsen, “Higher-Order Cryptanalysis of Block ciphers”, Ph.D Thesis, Technical University of Denmark, 1999.
T. Johansson, F. Jönsson, “Improved fast correlation attacks on stream ciphers via convolutional codes”, Advances in Cryptology-EUROCRYPT’99, Lecture Notes in Computer Science, vol. 1592, Springer-Verlag, 1999, pp. 347–362.
T. Johansson, F. Jönsson, “Fast correlation attacks based on turbo code techniques”, Advances in Cryptology-CRYPTO’99, Lecture Notes in Computer Science, vol. 1666, Springer-Verlag, 1999, pp. 181–197.
M. Kearns, “Efficient noise-tolerant learning from statistical queries”, Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, San Diego, California, 16–18 May 1993, pp. 392–401.
W. Meier, and O. Staffelbach, “Fast correlation attacks on stream ciphers”, Advances in Cryptology-EUROCRYPT’88, Lecture Notes in Computer Science, vol. 330, Springer-Verlag, 1988, pp. 301–314.
W. Meier, and O. Staffelbach, “Fast correlation attacks on certain stream ciphers”, Journal of Cryptology, vol. 1, 1989, pp. 159–176.
A. Menezes, P. van Oorschot, S. Vanstone, Handbook of Applied Cryptography, CRC Press, 1997.
M. Mihaljevic, M. Fossorier, and H. Imai, “A low-complexity and high-performance algorithm for the fast correlation attack”, Fast Software Encryption, FSE’2000, to appear in Lecture Notes in Computer Science, Springer-Verlag, 2000.
M. Mihaljevic, and J. Golic, “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, Springer-Verlag, 1990, pp. 165–175.
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, Springer-Verlag, 1996, pp. 159–172.
T. Siegenthaler, “Correlation-immunity of nonlinear combining functions for cryptographic applications”, IEEE Trans. on Information Theory, vol. IT-30, 1984, pp. 776–780.
T. Siegenthaler, “Decrypting a class of stream ciphers using ciphertext only”, IEEE Trans. on Computers, vol. C-34, 1985, pp. 81–85.
M. Sudan, “Decoding of Reed Solomon codes beyond the error-correction bound”, Journal of Complexity, vol. 13(1), March 1997, pp. 180–193.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Johansson, T., Jönsson, F. (2000). Fast Correlation Attacks through Reconstruction of Linear Polynomials. In: Bellare, M. (eds) Advances in Cryptology — CRYPTO 2000. CRYPTO 2000. Lecture Notes in Computer Science, vol 1880. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44598-6_19
Download citation
DOI: https://doi.org/10.1007/3-540-44598-6_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67907-3
Online ISBN: 978-3-540-44598-2
eBook Packages: Springer Book Archive