You are looking at a specific version 20190603:133348 of this paper.
See the latest version.
Paper 2019/464
The complexity of MinRank
Alessio Caminata and 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.
Note: Corrected a typo in the formula of the main theorem.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Preprint. MINOR revision.
- Keywords
- MinRank Problemminorssolving degreeCastelnuovo-Mumford regularityGroebner basesmultivariate cryptographypost-quantum cryptography.
- Contact author(s)
- alessio caminata @ unine ch
- History
- 2022-03-10: last of 4 revisions
- 2019-05-10: received
- See all versions
- Short URL
- https://ia.cr/2019/464
- License
-
CC BY
