10 citations · 12 across the 2 of their papers we have counts for
2 papers
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.CR2019★ 10 cited
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…