The complexity of the SupportMinors Modeling for the MinRank problem

DOI10.1007/S10623-025-01800-YMaRDI QIDQ7229186zbMATH OpenFDO

Authors Daniel Cabarcas, Giulia Gaggero, Elisa Gorla

Publication date 15 April 2026

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10623-025-01800-Y

zbMATH Keywords

MinRank problempost-quantum cryptographySupportMinors Modeling

Mathematics Subject Classification ID

Computer science (68-XX) Information and communication theory, circuits (94-XX)

Cites work

• A Complex That Resolves the Ideal of Minors Having n - 1 Columns in Common
• A polynomial time key-recovery attack on the Sidon cryptosystem
• An algebraic attack on rank metric code-based cryptosystems
• An Asymptotically Optimal Structural Attack on the ABC Multivariate Encryption Scheme
• Breaking rainbow takes a weekend on a laptop
• Coding and Cryptography
• Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology
• Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic
• Cryptanalysis of MinRank
• Designing a Rank Metric Based McEliece Cryptosystem
• Determinantal rings
• Durandal: a rank metric based signature scheme
• Efficient key recovery for all HFE signature variants
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• scientific article; zbMATH DE number 1583768 (Why is no real title available?)
• scientific article; zbMATH DE number 177612 (Why is no real title available?)
• scientific article; zbMATH DE number 704831 (Why is no real title available?)
• scientific article; zbMATH DE number 2081078 (Why is no real title available?)
• scientific article; zbMATH DE number 1515218 (Why is no real title available?)
• scientific article; zbMATH DE number 1418284 (Why is no real title available?)
• Improved attacks for characteristic-2 parameters of the cubic ABC Simple Matrix Encryption scheme
• Improved cryptanalysis of HFEv- via projection
• Improved cryptanalysis of UOV and Rainbow
• Improvement of algebraic attacks for solving superdetermined MinRank instances
• Improvements of algebraic attacks for solving the rank decoding and MinRank problems
• Improving support-minors rank attacks: applications to G\textit{e}MSS and Rainbow
• Key recovery attack for all parameters of \(\mathrm{HFE}^-\)
• Key recovery attack for ZHFE
• MR-DSS -- smaller MinRank-based (ring-)signatures
• Multivariate public key cryptosystem from Sidon spaces
• On the complexity of the generalized MinRank problem
• Progress in Cryptology - INDOCRYPT 2004
• Ranksign: an efficient signature algorithm based on the rank metric
• Structural attacks for public key cryptosystems based on Gabidulin codes
• Take your MEDS: digital signatures from matrix code equivalence
• The complexity of MinRank
• The first syzygies of determinantal ideals

This page was built for publication: The complexity of the SupportMinors Modeling for the MinRank problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7229186)