122 citations · 195 across the 4 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…
RQC revisited and more cryptanalysis for Rank-based Cryptography
Loïc Bidoux, Pierre Briaud, Maxime Bros +1
We propose two main contributions: first, we revisit the encryption scheme Rank Quasi-Cyclic (RQC) by introducing new efficient variations, in particular, a new class of codes, the…
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…