Finding low-weight polynomial multiples using discrete logarithm
<|reference_start|>Finding low-weight polynomial multiples using discrete logarithm: Finding low-weight multiples of a binary polynomial is a difficult problem arising in the context of stream ciphers cryptanalysis. The classical algorithm to solve this problem is based on a time memory trade-off. We will present an improvement to this approach using discrete logarithm rather than a direct representation of the involved polynomials. This gives an algorithm which improves the theoretical complexity, and is also very flexible in practice.<|reference_end|>
@article{didier2007finding,
    title={Finding low-weight polynomial multiples using discrete logarithm},
    author={Fr'ed'eric Didier (INRIA Rocquencourt), Yann Laigle-Chapuy (INRIA
  Rocquencourt)},
    journal={Dans IEEE International Symposium on Information Theory - ISIT'07
  (2007)},
    year={2007},
    archivePrefix={arXiv},
    eprint={cs/0701069},
    primaryClass={cs.CR}
}