A Fast Correlation Attack for LFSR-Based Stream Ciphers

  • Sarbani Palit
  • Bimal K. Roy
  • Arindom De
Conference paper

DOI: 10.1007/978-3-540-45203-4_26

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2846)
Cite this paper as:
Palit S., Roy B.K., De A. (2003) A Fast Correlation Attack for LFSR-Based Stream Ciphers. In: Zhou J., Yung M., Han Y. (eds) Applied Cryptography and Network Security. ACNS 2003. Lecture Notes in Computer Science, vol 2846. Springer, Berlin, Heidelberg


This paper describes a novel fast correlation attack of stream ciphers. The salient feature of the algorithm is the absence of any pre-processing or iterative phase, an usual feature of existing fast correlation attacks. The algorithm attempts to identify a number of bits of the original linear feedback shift register (LFSR) output from the received bits of the ciphertext. These are then used to construct a system of linear equations which are subsequently solved to obtain the initial conditions. The algorithm is found to perform well for LFSRs of large sizes but having sparse polynomials. It may be noted that such polynomials have low Hamming weight which is one more than the number of feedback connections or “taps” of the corresponding LFSR. Its performance is good in situations even where limited cipherlength is available. Another important contribution of the paper is a modification of the approach when the LFSR outputs are combined by a function which is correlation immune and perhaps, unknown to the decrypter.


Stream cipher Correlation attack LFSR polynomial Correlation immune function 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Sarbani Palit
    • 1
  • Bimal K. Roy
    • 2
  • Arindom De
    • 3
  1. 1.Computer Vision & Pattern Recognition Unit 
  2. 2.Applied Statistics Unit 
  3. 3.Indian Statistical Institute, INDIA 

Personalised recommendations