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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
