138 citations · 509 across the 16 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.CR2022★ 2 cited
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…
cs.CR2022★ 2 cited
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…