4 papers · 1 filter
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…
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…
An Algebraic Attack on Rank Metric Code-Based Cryptosystems
Magali Bardet, Pierre Briaud, Maxime Bros +4
The Rank metric decoding problem is the main problem considered in cryptography based on codes in the rank metric. Very efficient schemes based on this problem or quasi-cyclic vers…
Practical Algebraic Attack on DAGS
Magali Bardet, Manon Bertin, Alain Couvreur +1
DAGS scheme is a key encapsulation mechanism (KEM) based on quasi-dyadic alternant codes that was submitted to NIST standardization process for a quantum resistant public key algor…