An improved algorithm for fast correlation attack on stream ciphers

Fast correlation attack on binary linear feedback shift registers (LFSR) in stream generators for stream ciphers applications are very paramount cryptanalytic techniques which are based on the idea from iterative probabilistic decoding procedures for binary symmetric channels (BSC). This paper presents an efficient correlation attack on stream ciphers, which is equivalent to solve the problem of recovering the LFSRpsilas initial state (u₁, u₂,hellip,u_n) from the observed output sequence z. I consider the problem as a decoding problem for a linear [N,L] code. In order to enhance the speed of correlation attack, the Walsh transform is used, in addition, I adopt the multi-thread method to deal with the parity checks. The novel scheme provides better performance and lower complicity, improves the efficiency of fast correlation attack.