Abstract
A new simple algorithm for fast correlation attacks on stream ciphers is presented. The advantages of the new approach are at least two. Firstly, the new algorithm significantly reduces the memory requirements compared with some recent proposals [2],[3]. This allows more powerful attacks than previously. Secondly, the simplicity of the algorithm allows us to derive theoretical results. We determine the relation between the number of observed symbols, the correlation probability, and the allowed computational complexity, required for a successful attack. Hence, we can get theoretical estimates on the required computational complexity in cases when simulation is not possible.
Chapter PDF
Similar content being viewed by others
References
T. Siegenthaler, “Decryptinga class of stream ciphers usingciphertext only”, IEEE Trans. Comput., Vol. C-34, pp. 81–85, 1985.
T. Johansson, F. Jönsson, “Improved fast correlation attacks on stream ciphers via convolutional codes”, Proceedings of EUROCRYPT’99, Springer-Verlag, LNCS 1592, pp. 347–362.
T. Johansson, F. Jönsson, “Improved fast correlation attacks on stream ciphers via convolutional codes”, Proceedings of CRYPTO’99, Springer-Verlag, LNCS 1666, pp. 181–197.
W. Meier, and O. Staffelbach, “Fast correlation attacks on certain stream ciphers”, J. Cryptology, pp. 159–176, 1989.
M. Mihaljevic, and J.Dj. Golić, “A fast iterative algorithm for a shift register initial state reconstruction given the noisy output sequence”, Proc. Auscrypt’90, Springer-Verlag, LNCS 453, Eds. J. Seberry and J. Pieprzyk, pp. 165–175, 1990.
V. Chepyzhov, and B. Smeets, “On a fast correlation attack on stream ciphers”, Adv. Crypt.-EUROCRYPT’91, Brighton, UK, Springer-Verlag, LNCS 547, Ed, D.W. Davies, pp. 176–185, 1991.
J.Dj. Golić, “Computation of low-weight parity-check polynomials”, Electronic Letters, Vol.32,No. 21, Oct., pp. 1981–1982, 1996.
R.G. Gallager, Information Theory and Reliable Communications, John Wiley and Sons, Inc. New York, London, Sydney, Toronto, 1968.
F. MacWilliams, N. Sloane, The theory of error correcting codes, North Holland, 1977.
W. Penzhorn, “Correlation attacks on stream ciphers: Computinglo w weight parity checks based on error correcting codes”, FSE’96, Springer-Verlag, LNCS 1039, pp. 159–172.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chepyzhov, V.V., Johansson, T., Smeets, B. (2001). A Simple Algorithm for Fast Correlation Attacks on Stream Ciphers. In: Goos, G., Hartmanis, J., van Leeuwen, J., Schneier, B. (eds) Fast Software Encryption. FSE 2000. Lecture Notes in Computer Science, vol 1978. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44706-7_13
Download citation
DOI: https://doi.org/10.1007/3-540-44706-7_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41728-6
Online ISBN: 978-3-540-44706-1
eBook Packages: Springer Book Archive