Abstract
A novel fast algorithm for the correlation attack on a class of stream ciphers is proposed. The algorithm is based on the error correction principle and the finite-state matrix representation of a linear feedback shift register. Some general properties of the algorithm are pointed out and illustrated by some experimental results.
Preview
Unable to display preview. Download preview PDF.
References
T. Siegenthaler, "Decrypting a Class of Stream Ciphers Using Ciphertext Only", IEEE Trans. Comput., vol. C-34, Jan. 1985, pp.81–85.
W. Meier, O. Staffelbach, "Fast Correlation Attacks on Certain Stream Ciphers", Journal of Cryptology, vol.1, 1989., pp.159–176.
R.G. Gallager, "Low-Density Parity-Check Codes", IRE Trans. Inform. Theory, vol. IT-8, Jan. 1962, pp.21–28.
G. Battail, M.C. DeCouvelaere, P. Godlewski, "Replication Decoding", IEEE Trans. Inform. Theory, vol. IT-25, May 1979, pp.332–345.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mihaljevic, M.J., Golic, J.D. (1990). A fast iterative algorithm for a shift register initial state reconstruction given the noisy output sequence. In: Seberry, J., Pieprzyk, J. (eds) Advances in Cryptology — AUSCRYPT '90. AUSCRYPT 1990. Lecture Notes in Computer Science, vol 453. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030359
Download citation
DOI: https://doi.org/10.1007/BFb0030359
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53000-8
Online ISBN: 978-3-540-46297-2
eBook Packages: Springer Book Archive