138 citations · 509 across the 16 of their papers we have counts for
17 papers
Polynomial time key-recovery attack on high rate random alternant codes
Magali Bardet, Rocco Mora, Jean-Pierre Tillich
A long standing open question is whether the distinguisher of high rate alternant codes or Goppa codes \cite{FGOPT11} can be turned into an algorithm recovering the algebraic struc…
Improvement of algebraic attacks for solving superdetermined MinRank instances
Magali Bardet, Manon Bertin
The MinRank (MR) problem is a computational problem that arises in many cryptographic applications. In Verbel et al. (PQCrypto 2019), the authors introduced a new way to solve supe…
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…
An algebraic approach to the Rank Support Learning problem
Magali Bardet, Pierre Briaud
Rank-metric code-based cryptography relies on the hardness of decoding a random linear code in the rank metric. The Rank Support Learning problem (RSL) is a variant where an attack…
Decoding Reed-Solomon codes by solving a bilinear system with a Gröbner basis approach
Magali Bardet, Rocco Mora, Jean-Pierre Tillich
Decoding a Reed-Solomon code can be modeled by a bilinear system which can be solved by Gröbner basis techniques. We will show that in this particular case, these techniques are mu…
Improvements of Algebraic Attacks for solving the Rank Decoding and MinRank problems
Magali Bardet, Maxime Bros, Daniel Cabarcas +5
Rank Decoding (RD) is the main underlying problem in rank-based cryptography. Based on this problem and quasi-cyclic versions of it, very efficient schemes have been proposed recen…