Abstract
This paper describes new methods for fast correlation attacks, based on the theory of convolutional codes. They can be applied to arbitrary LFSR feedback polynomials, in opposite to the previous methods, which mainly focus on feedback polynomials of low weight. The results improve significantly the few previous results for this general case, and are in many cases comparable with corresponding results for low weight feedback polynomials.
This work was supported by the Foundation for Strategic Research — PCC Under Grant 9706-09.
Chapter PDF
References
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.
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.
R. G. Gallager, Low-Density Parity-Check Codes, MIT Press, Cambridge, MA, 1963.
R. Johannesson, K. Sh. Zigangirov, Fundamentals of Convolutional Codes, IEEE Press, New York, 1999.
J. Leon, “A probabilistic algorithm for computing minimum weights of large error-correcting codes”, IEEE Trans. Information Theory, vol. IT-34, 1988, pp. 1354–1359.
F. MacWilliams, N. Sloane, The Theory of Error Correcting Codes, North Holland, 1977.
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.
W. Meier, and O. Staffelbach, “Fast correlation attacks on certain stream ciphers”, Journal of Cryptology, vol. 1, 1989, pp. 159–176.
A. Menezes, P. van Oorschot, S. Vanstone, Handbook of Applied Cryptography, CRC Press, 1997.
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.
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.
T. Siegenthaler, “Correlation-immunity of nonlinear combining functions for cryptographic applications”, IEEE Trans. on Information Theory, vol. IT-30, 1984, pp. 776–780.
T. Siegenthaler, “Decrypting a class of stream ciphers using ciphertext only”, IEEE Trans. on Computers, vol. C-34, 1985, pp. 81–85.
L. Simpson, E. Dawson, J. Golic, M. Salamasizadeh, “Fast correlation attacks on the multiplexer generator”, Proc. IEEE 1998 International Symposium on Information Theory, ISIT’98, 1998, p. 270.
J. Stern, “A method for finding codewords of small weight,” Coding Theory and Applications, Springer-Verlag, 1989, pp. 106–113.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Johansson, T., Jönsson, F. (1999). Improved Fast Correlation Attacks on Stream Ciphers via Convolutional Codes. In: Stern, J. (eds) Advances in Cryptology — EUROCRYPT ’99. EUROCRYPT 1999. Lecture Notes in Computer Science, vol 1592. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48910-X_24
Download citation
DOI: https://doi.org/10.1007/3-540-48910-X_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65889-4
Online ISBN: 978-3-540-48910-8
eBook Packages: Springer Book Archive