Description
We here investigate the hardness of one of the most relevant problems in multivariate cryptography, namely MinRank: given non-negative intgers n,k,r, and matrices M_0,...,M_k, of size n with entries in F_q, decide whether there exists an F_q-linear combination of those matrices which has rank less than or equal to r. Our starting point is the Kipnis-Shamir modeling of the problem. We first prove new properties satisfed by this modeling. Then, we propose a practical resolution of it - based on a Groebner basis approach - that permits us to efficiently solve two challenges proposed by Courtois for his zero-knowledge authentication scheme, built upon MinRank.<br/> Next we turn to the theoretical complexity of the problem: we exhibit a multi-homogeneous structure of the algebraic system modeling the probem, that yields a theoretical bound on its hardness, reflecting the practical behaviour of our approach. Our main result is that, when the size of the matrices involved minus the target rank is constant, we can solve MinRank in polynomial time.<br/> This is a joint work with Jean-Charles Faugères and Ludovic Perret.
Prochains exposés
-
Some applications of linear programming to Dilithium
Orateur : Paco AZEVEDO OLIVEIRA - Thales & UVSQ
Dilithium is a signature algorithm, considered post-quantum, and recently standardized under the name ML-DSA by NIST. Due to its security and performance, it is recommended in most use cases. During this presentation, I will outline the main ideas behind two studies, conducted in collaboration with Andersson Calle-Vierra, Benoît Cogliati, and Louis Goubin, which provide a better understanding of[…] -
Wagner’s Algorithm Provably Runs in Subexponential Time for SIS^∞
Orateur : Johanna Loyer - Inria Saclay
At CRYPTO 2015, Kirchner and Fouque claimed that a carefully tuned variant of the Blum-Kalai-Wasserman (BKW) algorithm (JACM 2003) should solve the Learning with Errors problem (LWE) in slightly subexponential time for modulus q = poly(n) and narrow error distribution, when given enough LWE samples. Taking a modular view, one may regard BKW as a combination of Wagner’s algorithm (CRYPTO 2002), run[…]-
Cryptography
-
-
CryptoVerif: a computationally-sound security protocol verifier
Orateur : Bruno Blanchet - Inria
CryptoVerif is a security protocol verifier sound in the computational model of cryptography. It produces proofs by sequences of games, like those done manually by cryptographers. It has an automatic proof strategy and can also be guided by the user. It provides a generic method for specifying security assumptions on many cryptographic primitives, and can prove secrecy, authentication, and[…]-
Cryptography
-
-
Structured-Seed Local Pseudorandom Generators and their Applications
Orateur : Nikolas Melissaris - IRIF
We introduce structured‑seed local pseudorandom generators (SSL-PRGs), pseudorandom generators whose seed is drawn from an efficiently sampleable, structured distribution rather than uniformly. This seemingly modest relaxation turns out to capture many known applications of local PRGs, yet it can be realized from a broader family of hardness assumptions. Our main technical contribution is a[…]-
Cryptography
-