287 citations · 1.1k across the 48 of their papers we have counts for
4 papers · 1 filter
Revisiting Algebraic Attacks on MinRank and on the Rank Decoding Problem
Magali Bardet, Pierre Briaud, Maxime Bros +2
The Rank Decoding problem (RD) is at the core of rank-based cryptography. This problem can also be seen as a structured version of MinRank, which is ubiquitous in multivariate cryp…
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…
Time and Query Complexity Tradeoffs for the Dihedral Coset Problem
Maxime Remaud, André Schrottenloher, Jean-Pierre Tillich
The Dihedral Coset Problem (DCP) in has been extensively studied in quantum computing and post-quantum cryptography, as for instance, the Learning with Errors problem reduces…
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…