Fast correlation attacks through reconstruction of linear polynomials

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1880, Issue , 2000, Pages 300-315

  Johansson, Thomas ^a   Jönsson, Fredrik ^a  

^a LUND UNIVERSITY   (Sweden)

Author keywords

Correlation attacks; Learning theory; Reconstruction of polynomials; Stream ciphers

Indexed keywords

POLYNOMIALS; SHIFT REGISTERS;

CORRELATION ATTACK; FAST CORRELATION ATTACKS; LEARNING THEORY; LINEAR FEEDBACK SHIFT REGISTERS; LINEAR POLYNOMIALS; MULTIVARIATE POLYNOMIAL; POLYNOMIAL RECONSTRUCTION; STREAM CIPHERS;

CRYPTOGRAPHY;

EID: 84974625340     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44598-6_19     Document Type: Conference Paper

References (20)

1. 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.
2. 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.
3. 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.
4. 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.
5. 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.
6. 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.
7. O. Goldreich, R. Rubinfeld, M. Sudan, “Learning polynomials with queries: The highly noisy case”, 36th Annual Symposium on Foundation of Computer Science, Milwaukee, Wisconsin, 23-25 October 1995, pp. 294-303.
8. T. Jakobsen, “Higher-Order Cryptanalysis of Block ciphers”, Ph.D Thesis, Technical University of Denmark, 1999.
9. 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.
10. 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.
11. 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.
12. 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.
13. W. Meier, and O. Staffelbach, “Fast correlation attacks on certain stream ciphers”, Journal of Cryptology, vol. 1, 1989, pp. 159-176.
14. A. Menezes, P. van Oorschot, S. Vanstone, Handbook of Applied Cryptography, CRC Press, 1997.
15. 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.
16. 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.
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, Springer-Verlag, 1996, pp. 159-172.
18. T. Siegenthaler, “Correlation-immunity of nonlinear combining functions for cryptographic applications”, IEEE Trans. on Information Theory, vol. IT-30, 1984, pp. 776-780.
19. T. Siegenthaler, “Decrypting a class of stream ciphers using ciphertext only”, IEEE Trans. on Computers, vol. C-34, 1985, pp. 81-85.
20. M. Sudan, “Decoding of Reed Solomon codes beyond the error-correction bound”, Journal of Complexity, vol. 13(1), March 1997, pp. 180-193.