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).
Daniel Cabarcas, Giulia Gaggero, Elisa Gorla. The complexity of the SupportMinors Modeling for the MinRank Problem. // Designs, Codes and Cryptography. – 2026. – DOI: 10.1007/s10623-025-01800-y. – URL: https://doi.org/10.1007/s10623-025-01800-y
Daniel Cabarcas, Giulia Gaggero, & Elisa Gorla (2026). The complexity of the SupportMinors Modeling for the MinRank Problem. Designs, Codes and Cryptography. https://doi.org/10.1007/s10623-025-01800-y
Daniel Cabarcas, et al. “The complexity of the SupportMinors Modeling for the MinRank Problem.” Designs, Codes and Cryptography, 2026. doi:10.1007/s10623-025-01800-y.
@article{Cabarcas2026,
title = {The complexity of the SupportMinors Modeling for the MinRank Problem},
author = {Cabarcas, Daniel and Gaggero, Giulia and Gorla, Elisa},
journal = {Designs, Codes and Cryptography},
year = {2026},
doi = {10.1007/s10623-025-01800-y},
url = {https://doi.org/10.1007/s10623-025-01800-y}
}