Fast correlation attacks: An algorithmic point of view

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

Volumn 2332, Issue , 2002, Pages 209-221

  Chose, Philippe ^a   Joux, Antoine ^a   Mitton, Michel ^a  

^a DCSSI Crypto Lab   (France)

Author keywords

Algorithmics; Cryptanalysis; Fast correlation attacks; Linear feedback shift registers; Match and sort; Parity checks; Stream ciphers

Indexed keywords

CRYPTOGRAPHY; SHIFT REGISTERS;

ALGORITHMICS; CRYPTANALYSIS; FAST CORRELATION ATTACKS; LINEAR FEEDBACK SHIFT REGISTERS; PARITY CHECK; STREAM CIPHERS;

PARALLEL PROCESSING SYSTEMS;

EID: 84888039254     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46035-7_14     Document Type: Conference Paper

References (13)

1. 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.
2. 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.
3. 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.
4. ´E. 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.
5. T. Johansson and F. Jonsson. 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.
6. 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.
7. W. Meier and O. Staffelbach. Fast correlation attacks on certain stream ciphers. Journal of Cryptology, 1:159–176, 1989.
8. M. Mihaljevic, M. P. C. Fossorier, and H. Imai. A low-complexity and highperformance algorithm for fast correlation attack. In Fast Software Encryption – FSE’00, pages 196–212. Springer Verlag, 2000.
9. M. Mihaljevic, 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.
10. 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.
11. 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.
12. T. Siegenthaler. Correlation-immunity of nonlinear combining functions for cryptographic applications. IEEE Trans. on Information Theory, IT-30:776–780, 1984.
13. T. Siegenthaler. Decrypting a class of stream ciphers using ciphertext only. IEEE Trans. Comput., C-34:81–85, 1985.