Public-key encryption from the MinRank problem

DOI10.1007/978-3-032-25327-9_16MaRDI QIDQ7304124zbMATH OpenFDO

Authors R. Chatterjee, Changrui Mu, Prashant Nalini Vasudevan

Publication date 24 July 2026

Full work available at URL https://doi.org/10.1007/978-3-032-25327-9_16

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• A new efficient algorithm for computing Gröbner bases (F₄)
• A public key system with signature and master key functions
• Attacks and counter-attacks on the GPT public key cryptosystem
• Batch verification for statistical zero knowledge proofs
• Bilinear forms over a finite field, with applications to coding theory
• Breaking rainbow takes a weekend on a laptop
• Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
• Building MPCitH-based signatures from MQ, MinRank, and rank SD
• Coding and Cryptography
• Column scrambler for the GPT cryptosystem
• Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology
• Cryptanalysis of MinRank
• Designing a Rank Metric Based McEliece Cryptosystem
• Efficient algorithms for solving overdefined systems of multivariate polynomial equations
• Error and erasure correcting algorithms for rank codes
• Foundations of Cryptography
• Gabidulin matrix codes and their application to small ciphertext size cryptosystems
• scientific article; zbMATH DE number 1583768 (Why is no real title available?)
• scientific article; zbMATH DE number 1617932 (Why is no real title available?)
• scientific article; zbMATH DE number 3989251 (Why is no real title available?)
• scientific article; zbMATH DE number 177612 (Why is no real title available?)
• scientific article; zbMATH DE number 2081078 (Why is no real title available?)
• scientific article; zbMATH DE number 2151220 (Why is no real title available?)
• scientific article; zbMATH DE number 1418284 (Why is no real title available?)
• 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
• MinRank in the head. Short signatures from zero-knowledge proofs
• Modified GPT PKC with right scrambler
• More on average case vs approximation complexity
• On the complexity of ``Superdetermined minrank instances
• On the complexity of the generalized MinRank problem
• On the security of a Loidreau rank metric code based encryption scheme
• Progress in Cryptology – Mycrypt 2005
• Proving hard-core predicates using list decoding
• Public-coin statistical zero-knowledge batch verification against malicious verifiers
• Rank-metric codes
• Rank-metric codes and their duality theory
• Reducible rank codes and their applications to cryptography
• Refined F5 Algorithms for Ideals of Minors of Square Matrices
• Severely denting the Gabidulin version of the McEliece public key cryptosystem
• Structural attacks for public key cryptosystems based on Gabidulin codes
• The computational complexity of some problems of linear algebra
• Theory of codes with maximum rank distance

This page was built for publication: Public-key encryption from the MinRank problem

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