Finding low-weight polynomial multiples using discrete logarithm - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2007

Finding low-weight polynomial multiples using discrete logarithm

Frédéric Didier
  • Function : Author
  • PersonId : 837467
Yann Laigle-Chapuy
  • Function : Author
  • PersonId : 833446


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.
Fichier principal
Vignette du fichier
DidierLaiglechapuy.pdf (106.16 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00123316 , version 1 (09-01-2007)
inria-00123316 , version 2 (15-01-2007)
inria-00123316 , version 3 (12-07-2007)



Frédéric Didier, Yann Laigle-Chapuy. Finding low-weight polynomial multiples using discrete logarithm. IEEE International Symposium on Information Theory - ISIT'07, Jun 2007, Nice, France. ⟨inria-00123316v3⟩


26 View
162 Download



Gmail Facebook Twitter LinkedIn More