The complexity of MinRank

Alessio Caminata; Elisa Gorla

Paper 2019/464 Original: eprint.iacr.org/2019/464 ↗

The complexity of MinRank

Alessio Caminata

Elisa Gorla

Abstract

In this note, we leverage some of our previous results 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ère, Safey El Din, Spaenlehauer.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Preprint.
History: 2022-03-10: last updated; 2019-05-10: published
Short URL: https://ia.cr/2019/464
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2019/464,
      author = {Alessio Caminata and Elisa Gorla},
      title = {The complexity of MinRank},
      howpublished = {Cryptology {ePrint} Archive, Paper 2019/464},
      year = {2019},
      url = {https://eprint.iacr.org/2019/464}
}