Multivariate Public Key Cryptosystem (MPKC) seem to be promising toward future digital
security even in the presence of quantum adversaries. MPKCs derive their security from the …

In this paper, we show how to significantly improve algebraic techniques for solving the
MinRank problem, which is ubiquitous in multivariate and rank metric code based …

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 …

Multivariate public‐key cryptography (MPKC) is considered a leading candidate for post‐
quantum cryptography (PQC). It is based on the hardness of the multivariate quadratic …

Abstract The Rank Decoding problem (RD) is at the core of rank-based cryptography.
Cryptosystems such as ROLLO and RQC, which made it to the second round of the NIST …

We introduce a novel algebraic approach for attacking the McEliece cryptosystem which is
currently at the 4-th round of the NIST competition. The contributions of the article are …

In recent years, many digital signature scheme proposals have been built from the so-called
MPC-in-the-head paradigm. This has shown to be an outstanding way to design efficient …

The MinRank (MR) problem is a computational problem that arises in many cryptographic
applications. In Verbel et al., the authors introduced a new way to solve superdetermined …

In this work, we introduce a new attack for the Loidreau scheme [PQCrypto 2017] and its
more recent variant LowMS. This attack is based on a constrained linear system for which …

Abstract Currently the National Institute of Standards and Technology (NIST) is engaged in a
post-quantum standardization effort, analyzing numerous candidate schemes to provide …