Smith-Tone, D.
(2023),
The Generating Series of Support Minors MinRank Ideals, Cryptology Eprint Archive, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=956346, https://ia.cr/2023/1456
(Accessed October 12, 2025)
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
The Generating Series of Support Minors MinRank Ideals
Published
Author(s)
Abstract
The support minors method has become indispensable to cryptanalysts in attacking various post-quantum cryptosystems in the areas of multivariate cryptography and rank-based cryptography. The complexity analysis for support minors minrank calculations is a bit messy, with no closed form for the Hilbert series of the ideal generated by the support minors equations (or, more correctly, for the quotient of the polynomial ring by this ideal). In this article, we provide a generating series whose coefficients are the Hilbert Series of related MinRank ideals. This simple series therefore reflects and relates the structure of all support minors ideals. Its simplicity also makes it practically useful in computing the complexity of support minors instances.Citation
Cryptology Eprint Archive
Volume
2023
Pub Weblink
Pub Type
Websites
Download Paper
Keywords
Multivariate Cryptography, Rank-Based Cryptography, Hilbert Series, MinRank.
Citation
Issues
If you have any questions about this publication or are having problems accessing it, please contact [email protected].
Created September 24, 2023, Updated January 4, 2024