A Low-Complexity and High-Performance algorithm for the fast correlation attack

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

Volumn 1978, Issue , 2001, Pages 196-212

  Mihaljević, Miodrag J ^a   Fossorier, Marc P C ^b   Imai, Hideki ^c  

^a MATHEMATICAL INSTITUTE   (Serbia)

^b University of Hawaii at Manoa   (United States)

^c INSTITUTE OF INDUSTRIAL SCIENCE   (Japan)

Author keywords

Decoding; Fast correlation attack; Keystream generators; Linear feedback shift registers; Stream ciphers

Indexed keywords

CONVOLUTIONAL CODES; CRYPTOGRAPHY; DECODING; ECONOMIC AND SOCIAL EFFECTS; PARALLEL ARCHITECTURES; SHIFT REGISTERS;

FAST CORRELATION ATTACKS; HIGH PERFORMANCE ALGORITHMS; KEYSTREAM GENERATORS; LINEAR FEEDBACK SHIFT REGISTERS; POSTERIOR PROBABILITY; SOFTWARE IMPLEMENTATION; STREAM CIPHERS; UNDERLYING PRINCIPLES;

ITERATIVE DECODING;

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

References (20)

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.
2. V. Chepyzhov and B. Smeets, “On fast correlation attack on certain stream ci- phers”, Advances in Cryptology - EUROCRYPT '91, Lecture Notes in Computer Science, vol. 547, pp. 176-185, 1991.
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.
4. R. G. Gallager, “Low-density parity-check codes,” IRE Transactions on Informa- tion Theory, vol. IT-8, pp. 21-28, Jan. 1962.
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.
6. M. P. C. Fossorier, M. J. Mihaljević and H. Imai, “Critical noise for convergence of iterative probabilistic decoding with belief propagation in cryptographic appli- cations”, Applied Algebra, Algebraic Algorithms and Error Correcting Codes - AAECC 13, Lecture Notes in Computer Science, vol. 1719, pp. 282-293, 1999.
7. R. Johannesson and K. Zigangirov, Fundamentals of Convolutional Coding. New York: IEEE Press, 1999.
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.
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.
10. J. L. Massey, Threshold Decoding. Cambridge, MA: MIT Press, 1963.
11. A. Menezes, P.C. van Oorschot and S.A. Vanstone, Handbook of Applied Crypto- graphy. Boca Raton: CRC Press, 1997.
12. W. Meier and O. Staffelbach, “Fast correlation attacks on certain stream ciphers,” Journal of Cryptology, vol. 1, pp. 159-176, 1989.
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 Crypto- logy - AUSCRYPT '90, Lecture Notes in Computer Science, vol. 453, pp. 165-175, 1990.
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.
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.
16. M. J. Mihaljević and J. Golić, “A method for convergence analysis of iterative probabilistic decoding”, accepted for publication in IEEE Transactions on Infor- mation Theory.
17. W. Penzhorn, “Correlation attacks on stream ciphers: Computing low-weight pa- rity checks based on error-correcting codes”, Fast Software Encryption - FSE'96, Lecture Notes in Computer Science, vol. 1039, pp. 159-172, 1996.
18. T. Siegenthaler, “Decrypting a class of stream ciphers using ciphertext only”, IEEE Transactions on Computers, vol. C-34, pp. 81-85, 1985.
19. K. Zeng and M. Huang, “On the linear syndrome method in cryptanalysis,” Ad- vances in Cryptology - CRYPTO '88, Lecture Notes in Computer Science, vol. 403, pp. 469-478, 1990.
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.