Computation of low-weight parity checks for correlation attacks on stream ciphers

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

Volumn 1025, Issue , 1995, Pages 74-83

  Penzhorn, W T ^a   Kuhn G J ^a  

^a UNIVERSITY OF PRETORIA   (South Africa)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY;

ARBITRARY NUMBER; ARBITRARY POLYNOMIAL; BIRTHDAY PARADOXES; CHARACTERISTIC POLYNOMIALS; CORRELATION ATTACK; DISCRETE LOGARITHMS; FAST CORRELATION ATTACKS; STREAM CIPHERS;

POLYNOMIALS;

EID: 84947926195     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60693-9_10     Document Type: Conference Paper

References (14)

1. W. Meier and O. Staffelbach, "Fast correlation attacks on certain stream ciphers," Journal of Cryptology, vol. 1, no. 3, pp. 159-176, 1989.
2. D. Coppersmith, "Fast evaluation of logarithms in fields of characteristic two," IEEE Trans, on Information Theory, vol. IT-30, no. 4, pp. 587-594, July 1984.
3. J. L. Massey, "Shift-register synthesis and BCH decoding," IEEE Trans. Information Theory, vol. IT-15, pp. 122-127, 1969.
4. T. Siegenthaler, "Decrypting a class of stream ciphers using ciphertext only," IEEE Trans. Computers, vol. C-34, pp. 81-85, 1985.
5. J. O. Brüer, "On nonlinear combinations of linear shift register sequences," in Proc. IEEE ISIT, les Arcs, France, June 21-25 1982.
6. P. R. Geffe, "How to protect data with ciphers that are really hard to break," Electronics, pp. 99-101, January 1973.
7. V. S. Pless, "Encryption schemes for computer confidentiality," IEEE Trans. Computers, vol. C-26, pp. 1133-1136, November 1977.
8. C. Chepyzhov and B. Smeets, "On a fast correlation attack on stream ciphers," in Advances in Cryptology-EUROCRYPT '91. 1991, pp. 176-185, Springer-Verlag.
9. M. J. Mihaljevic and J. Golic, "A comparison of cryptanalytic principles based on iterative error-correction," in Advances in Cryptology-EUROCRYPT '91. 1991, pp. 527-531, Springer-Verlag.
10. K. Zeng and M. Huang, "On the linear syndrome method in cryptanalysis," in Advances in Cryptology-CRYPTO '88. 1990, pp. 469-478, Springer-Verlag.
11. K. Nishimura and M. Sibuya, "Probability to meet in the middle," J. of Cryptology, vol. 2, no. 1, pp. 13-22, 1990.
12. K. Huber, "Some comments on Zech's logarithm," IEEE Trans. Information Theory, vol. IT-36, no. 4, pp. 946-950, July 1990.
13. A. M. Odlyzko, "Discrete logarithms and their cryptographic significance," in Advances in Cryptology-EUROCRYPT '84 1985, pp. 224-314, Springer-Verlag.
14. I. F. Blake, R. Fuji-Hara, R. C. Mullin, and S. A. Vanstone, "Computing logarithms in finite fields of characteristic two," SIAM Journal on Algebraic Discrete Methods, vol. 5, pp. 276-285, 1985.