The authors prove rigorous complexity bounds for the SupportMinors MinRank attack at degrees b=1 and b=2, confirming the heuristic estimates from earlier work.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CR 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
The complexity of the SupportMinors Modeling for the MinRank Problem
The authors prove rigorous complexity bounds for the SupportMinors MinRank attack at degrees b=1 and b=2, confirming the heuristic estimates from earlier work.