36 citations · 36 across the 3 of their papers we have counts for
3 papers
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.IT2009★ 36 cited
Efficient erasure decoding of Reed-Solomon codes
Frederic Didier
We present a practical algorithm to decode erasures of Reed-Solomon codes over the q elements binary field in O(q \log_2^2 q) time where the constant implied by the O-notation is v…
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…