36 citations · 37 across the 5 of their papers we have counts for
Showing 2009Show all
3 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.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.IT2009
Invertible Extractors and Wiretap Protocols
Mahdi Cheraghchi, Frederic Didier, Amin Shokrollahi
A wiretap protocol is a pair of randomized encoding and decoding functions such that knowledge of a bounded fraction of the encoding of a message reveals essentially no information…