On a fast correlation attack on certain stream ciphers

  • Authors:
  • Vladimir Chepyzhov;Ben Smeets

  • Affiliations:
  • Institute for Problems of Information Transmission, USSR Academy of Sciences, Moscow, USSR;Department of Information Theory, Lund University, Lund, Sweden

  • Venue:
  • EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
  • Year:
  • 1991

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.