[Resource Topic] 2019/464: The complexity of MinRank

Welcome to the resource topic for 2019/464

The complexity of MinRank

Authors: Alessio Caminata, Elisa Gorla


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.

ePrint: https://eprint.iacr.org/2019/464

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .