On a fast correlation attack on certain streaxn ciphers

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

Volumn 547 LNCS, Issue , 1991, Pages 176-185

  Chepyzhov, Vladimir ^a   Smeets, Ben ^b  

^a INSTITUTE FOR INFORMATION TRANSMISSION PROBLEMS   (Russian Federation)

^b LUND UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; SHIFT REGISTERS;

FAST CORRELATION ATTACKS; FEEDBACK POLYNOMIAL; INITIAL STATE; LINEAR FEEDBACK SHIFT REGISTERS; OPTIMAL RECOVERY; OUTPUT SEQUENCES; RECOVERY PROCESS;

RECOVERY;

EID: 85030473541     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46416-6_16     Document Type: Conference Paper

References (6)

1. T. Siegenthaler, ’’Decrypting a class of stream ciphers using ciphertext only”, IEEE Trans. Comput., Vol. C-34, 1985, pp. 81-85.
2. W. Meier, and O. Staffelbach,’’Fast correlation attacks on certain stream ciphers”, J. Cryptology, 1989, pp. 159-176.
3. M. Mihaljevic, and J. Golic, “A fast iterative algorithm for a shift register initial state reconstruction given the noisy output sequence”, Proc. Auscrypt 1990, pp. 165-175.
4. [41 G. S. Evseev, "Complexity of decoding for linear codes”, Probl. Peredach. Inform., Vol. 19, 1983, pp. 3-8.
5. J. T. Coffey, and R. M. Goodman, ’’The complexity of information set decoding”, IEEE Trans. Inform. Theory, Vol. IT-36, 1990, pp. 1031-1037.
6. R. G. Gallager, Low-Density Parity-Check Codes, MIT Press, Cambridge, MA, 1963.