A fast iterative algorithm for a shift register initial state reconstruction given the noisy output sequence

  • Miodrag J. Mihaljevic
  • Jovan Dj. Golic
Section 5 Pseudorandomness And Sequences II
Part of the Lecture Notes in Computer Science book series (LNCS, volume 453)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    T. Siegenthaler, "Decrypting a Class of Stream Ciphers Using Ciphertext Only", IEEE Trans. Comput., vol. C-34, Jan. 1985, pp.81–85.Google Scholar
  2. [2]
    W. Meier, O. Staffelbach, "Fast Correlation Attacks on Certain Stream Ciphers", Journal of Cryptology, vol.1, 1989., pp.159–176.Google Scholar
  3. [3]
    R.G. Gallager, "Low-Density Parity-Check Codes", IRE Trans. Inform. Theory, vol. IT-8, Jan. 1962, pp.21–28.Google Scholar
  4. [4]
    G. Battail, M.C. DeCouvelaere, P. Godlewski, "Replication Decoding", IEEE Trans. Inform. Theory, vol. IT-25, May 1979, pp.332–345.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Miodrag J. Mihaljevic
    • 1
  • Jovan Dj. Golic
    • 1
  1. 1.Institute of Applied Mathematics and Electronics, Belgrade, Faculty of Electrical EngineeringUniversity of BelgradeBeogradYugoslavia

Personalised recommendations