1 citations · 1 across the 3 of their papers we have counts for
Showing cs.CRShow all
2 papers · 1 filter
cs.CR2025★ 1 cited
The complexity of the SupportMinors Modeling for the MinRank Problem
Daniel Cabarcas, Giulia Gaggero, Elisa Gorla
In this note, we provide proven estimates for the complexity of the SupportMinors Modeling, mostly confirming the heuristic complexity estimates contained in the original article.
cs.CR2023
The complexity of solving a system of equations of the same degree
Giulia Gaggero, Elisa Gorla
Many systems of interest in cryptography consist of equations of the same degree. Under the assumption that the degree of regularity is finite, we prove upper bounds on the degree…