4 citations · 8 across the 11 of their papers we have counts for
3 papers · 1 filter
Statistical Decoding 2.0: Reducing Decoding to LPN
Kevin Carrier, Thomas Debris-Alazard, Charles Meyer-Hilfiger +1
The security of code-based cryptography relies primarily on the hardness of generic decoding with linear codes. The best generic decoding algorithms are all improvements of an old…
Smoothing Codes and Lattices: Systematic Study and New Bounds
Thomas Debris-Alazard, Léo Ducas, Nicolas Resch +1
In this article we revisit smoothing bounds in parallel between lattices codes. Initially introduced by Micciancio and Regev, these bounds were instantiated with Gaussian dis…
On Codes and Learning With Errors over Function Fields
Maxime Bombar, Alain Couvreur, Thomas Debris-Alazard
It is a long standing open problem to find search to decision reductions for structured versions of the decoding problem of linear codes. Such results in the lattice-based setting…