The complexity of MinRank
Symbolic Computation
2022-03-11 v3 Cryptography and Security
Abstract
In this note, we leverage some of our results from arXiv:1706.06319 to produce a concise and rigorous proof for the complexity of the generalized MinRank Problem in the under-defined and well-defined case. Our main theorem recovers and extends previous results by Faug\`ere, Safey El Din, Spaenlehauer (arXiv:1112.4411).
Cite
@article{arxiv.1905.02682,
title = {The complexity of MinRank},
author = {Alessio Caminata and Elisa Gorla},
journal= {arXiv preprint arXiv:1905.02682},
year = {2022}
}
Comments
Final version. Theorem numbering adjusted to match the published version