Improvements of algebraic attacks for solving the rank decoding and MinRank problems
From MaRDI portal
Publication:2692353
DOI10.1007/978-3-030-64837-4_17OpenAlexW3034712312MaRDI QIDQ2692353
Jean-Pierre Tillich, Ray Perlner, Maxime Bros, Daniel Smith-Tone, Daniel Cabarcas, Magali Bardet, Philippe Gaborit, Javier A. Verbel
Publication date: 21 March 2023
Full work available at URL: https://arxiv.org/abs/2002.08322
Related Items
Efficient key recovery for all HFE signature variants, Compact post-quantum signatures from proofs of knowledge leveraging structure for the \textsf{PKP, SD} and \textsf{RSD} problems, Revisiting algebraic attacks on MinRank and on the rank decoding problem, Refined F5 Algorithms for Ideals of Minors of Square Matrices, New time-memory trade-offs for subset sum -- improving ISD in theory and practice, Breaking rainbow takes a weekend on a laptop, Cryptanalysis and repair of a Gabidulin code based cryptosystem from ACISP 2018, Improving support-minors rank attacks: applications to G\textit{e}MSS and Rainbow, LRPC codes with multiple syndromes: near ideal-size KEMs without ideals, Improvement of algebraic attacks for solving superdetermined MinRank instances, Exploiting ROLLO's constant-time implementations with a single-trace analysis, McEliece-type encryption based on Gabidulin codes with no hidden structure, MinRank in the head. Short signatures from zero-knowledge proofs, Take your MEDS: digital signatures from matrix code equivalence, Graph-theoretic algorithms for the alternating trilinear form equivalence problem, On the complexity of solving generic overdetermined bilinear systems, MR-DSS -- smaller MinRank-based (ring-)signatures, IPRainbow, 2F -- a new method for constructing efficient multivariate encryption schemes, Algebraic relation of three MinRank algebraic modelings, A new McEliece-type cryptosystem using Gabidulin-Kronecker product codes, Statistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge, Cryptanalysis of a code-based full-time signature, Improved cryptanalysis of UOV and Rainbow, Multivariate public key cryptosystem from Sidon spaces, A gapless code-based hash proof system based on RQC and its applications, Rank-Metric Codes and Their Applications, A Novel Niederreiter-like cryptosystem based on the (u|u + υ)-construction codes, Classical and quantum algorithms for generic syndrome decoding problems and applications to the Lee metric, New practical multivariate signatures from a nonlinear modifier, An algebraic approach to the rank support learning problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Theory of codes with maximum rank distance
- The computational complexity of some problems of linear algebra
- Two attacks on rank metric code-based schemes: RankSign and an IBE scheme
- Improved cryptanalysis of rank metric schemes based on Gabidulin codes
- A new rank metric codes based encryption scheme
- New technique for decoding codes in the rank metric and its cryptography applications
- An algebraic attack on rank metric code-based cryptosystems
- Durandal: a rank metric based signature scheme
- On the complexity of ``Superdetermined minrank instances
- Design Principles for HFEv- Based Multivariate Signature Schemes
- Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
- RankSign: An Efficient Signature Algorithm Based on the Rank Metric
- ZHFE, a New Multivariate Public Key Encryption Scheme
- Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology
- On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes
- On the Complexity of the Rank Syndrome Decoding Problem
- Hybrid approach for solving multivariate systems over finite fields
- Cryptanalysis of MinRank
- Solving sparse linear equations over finite fields
- New Results for Rank-Based Cryptography
- Progress in Cryptology – Mycrypt 2005
