Progress in multivariate cryptography: Systematic review, challenges, and research directions
J Dey, R Dutta - ACM Computing Surveys, 2023 - dl.acm.org
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 …
security even in the presence of quantum adversaries. MPKCs derive their security from the …
Improvements of algebraic attacks for solving the rank decoding and MinRank problems
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 …
MinRank problem, which is ubiquitous in multivariate and rank metric code based …
An algebraic attack on rank metric code-based cryptosystems
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 …
on codes in the rank metric. Very efficient schemes based on this problem or quasi-cyclic …
Recent progress in the security evaluation of multivariate public‐key cryptography
Y Ikematsu, S Nakamura, T Takagi - IET Information Security, 2023 - Wiley Online Library
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 …
quantum cryptography (PQC). It is based on the hardness of the multivariate quadratic …
Revisiting algebraic attacks on MinRank and on the rank decoding problem
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 …
Cryptosystems such as ROLLO and RQC, which made it to the second round of the NIST …
A new approach based on quadratic forms to attack the McEliece cryptosystem
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 …
currently at the 4-th round of the NIST competition. The contributions of the article are …
MinRank in the head: Short signatures from zero-knowledge proofs
G Adj, L Rivera-Zamarripa, J Verbel - International Conference on …, 2023 - Springer
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 …
MPC-in-the-head paradigm. This has shown to be an outstanding way to design efficient …
Improvement of algebraic attacks for solving superdetermined MinRank instances
M Bardet, M Bertin - International Conference on Post-Quantum …, 2022 - Springer
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 …
applications. In Verbel et al., the authors introduced a new way to solve superdetermined …
Cryptanalysis of rank-metric schemes based on distorted Gabidulin codes
P Briaud, P Loidreau - International Conference on Post-Quantum …, 2023 - Springer
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 …
more recent variant LowMS. This attack is based on a constrained linear system for which …
Rainbow band separation is better than we thought
R Perlner, D Smith-Tone - Cryptology ePrint Archive, 2020 - eprint.iacr.org
Abstract Currently the National Institute of Standards and Technology (NIST) is engaged in a
post-quantum standardization effort, analyzing numerous candidate schemes to provide …
post-quantum standardization effort, analyzing numerous candidate schemes to provide …