8 citations · 13 across the 5 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.CR2011
Decoding square-free Goppa codes over $\F_p$
Paulo S. L. M. Barreto, Rafael Misoczki, Richard Lindner
We propose a new, efficient non-deterministic decoding algorithm for square-free Goppa codes over $\F_p$ for any prime . If the code in question has degree and the average d…
cs.CR2011★ 3 cited
Key Reduction of McEliece's Cryptosystem Using List Decoding
Morgan Barbier, Barreto S. L. M. Paulo
Different variants of the code-based McEliece cryptosystem were pro- posed to reduce the size of the public key. All these variants use very structured codes, which open the door t…