Designs, Codes and Cryptography Computer Science Applications

The complexity of the SupportMinors Modeling for the MinRank Problem

Daniel Cabarcas, Giulia Gaggero, Elisa Gorla
Springer Nature · 2026-03-30 · DOI 10.1007/s10623-025-01800-y

Abstract

Abstract 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 (Bardet (2020) Improvements of algebraic attacks for solving the rank decoding and MinRank problems. In: Advances in cryptology. Springer, pp 507–536).

Read at publisher →