36 citations · 36 across the 3 of their papers we have counts for
Showing cs.CRShow all
2 papers · 1 filter
cs.CR2009
Attacking the combination generator
Frédéric Didier, Yann Laigle-Chapuy
We present one of the most efficient attacks against the combination generator. This attack is inherent to this system as its only assumption is that the filtering function has a g…
cs.CR2007
Finding low-weight polynomial multiples using discrete logarithm
Frédéric Didier, Yann Laigle-Chapuy
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…