Abstract :
It is shown that a method for computing low-weight polynomial multiples based on the birthday paradox cannot work as originally suggested. A probabilistic model is introduced and a modified method is proposed and analysed. The results are important for fast correlation attacks on stream ciphers based on linear feedback shift registers.
Keywords :
"Polynomials","Cryptography","Shift registers","Correlation"
