Computation of low-weight parity-check polynomials
- 10 October 1996
- journal article
- Published by Institution of Engineering and Technology (IET) in Electronics Letters
- Vol. 32 (21) , 1981-1982
- https://doi.org/10.1049/el:19961338
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
This publication has 4 references indexed in Scilit:
- Convergence of a Bayesian Iterative Error-Correction Procedure on a Noisy Shift Register SequencePublished by Springer Nature ,2001
- On A Fast Correlation Attack on Certain Stream CiphersPublished by Springer Nature ,2001
- Correlation attacks on stream ciphers: Computing low-weight parity checks based on error-correcting codesPublished by Springer Nature ,1996
- Towards Fast Correlation Attacks on Irregularly Clocked Shift RegistersPublished by Springer Nature ,1995