On A Fast Correlation Attack on Certain Stream Ciphers

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 547)


In this paper we present a new algorithm for the recovery of the initial state of a linear feedback shift register when a noisy output sequence is given. Our work is focussed on the investigation of the asymptotical behaviour of the recovery process rather than on the construction of an optimal recovery procedure. Our results show the importance of low-weight checks and show also that the complexity of the recovery problem grows less than exponentially with the length of the shift register, even if the number of taps grows linearly with the register length. Our procedure works for shift register with arbitrary feedback polynomial.


Linear Code Shift Register Stream Cipher Linear Feedback Shift Register Iterative Improvement 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. [1]
    T. Siegenthaler, “Decrypting a class of stream ciphers using ciphertext only”, IEEE Trans. Comput., Vol. C-34, 1985, pp. 81–85.CrossRefGoogle Scholar
  2. [2]
    W. Meier, and O. Staffelbach, “Fast correlation attacks on certain stream ciphers”, J. Cryptology, 1989, pp. 159–176.Google Scholar
  3. [3]
    M. Mihaljevic, and J. Golic, “A fast iterative algorithm for a shift register initial state reconstruction given the noisy output sequence”, Proc. Auscrypt 1990, pp. 165–175.Google Scholar
  4. [4]
    G. S. Evseev, “Complexity of decoding for linear codes”, Probl. Peredach. Inform., Vol. 19, 1983, pp. 3–8.MathSciNetGoogle Scholar
  5. [5]
    J. T. Coffey, and R. M. Goodman, “The complexity of information set decoding”, IEEE Trans. Inform. Theory, Vol. IT-36, 1990, pp. 1031–1037.CrossRefMathSciNetGoogle Scholar
  6. [6]
    R. G. Gallager, Low-Density Parity-Check Codes, MIT Press, Cambridge, MA, 1963.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  1. 1.Institute for Problems of Information TransmissionUSSR Academy of SciencesMoscowUSSR
  2. 2.Department of Information TheoryLund UniversityLundSweden

Personalised recommendations