The complexity of the SupportMinors Modeling for the MinRank Problem

Giulia Gaggero; Elisa Gorla; Daniel Cabarcas

Paper 2025/1083 Original: eprint.iacr.org/2025/1083 ↗

The complexity of the SupportMinors Modeling for the MinRank Problem

Giulia Gaggero

Elisa Gorla

Daniel Cabarcas

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.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Preprint.
History: 2025-06-09: last updated; 2025-06-09: published
Short URL: https://ia.cr/2025/1083
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2025/1083,
      author = {Giulia Gaggero and Elisa Gorla and Daniel Cabarcas},
      title = {The complexity of the SupportMinors Modeling for the MinRank Problem},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/1083},
      year = {2025},
      url = {https://eprint.iacr.org/2025/1083}
}