An algebraic attack on rank metric code-based cryptosystems
From MaRDI portal
Publication:2055648
DOI10.1007/978-3-030-45727-3_3zbMath1479.94122arXiv1910.00810OpenAlexW2978669775MaRDI QIDQ2055648
Olivier Ruatta, Maxime Bros, Jean-Pierre Tillich, Pierre Briaud, Philippe Gaborit, Vincent Neiger, Magali Bardet
Publication date: 1 December 2021
Full work available at URL: https://arxiv.org/abs/1910.00810
Cryptography (94A60) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items (18)
On the security of the modified dual-Ouroboros PKE using Gabidulin codes ⋮ Revisiting algebraic attacks on MinRank and on the rank decoding problem ⋮ Refined F5 Algorithms for Ideals of Minors of Square Matrices ⋮ Cryptanalysis and repair of a Gabidulin code based cryptosystem from ACISP 2018 ⋮ 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 ⋮ IPRainbow ⋮ A new McEliece-type cryptosystem using Gabidulin-Kronecker product codes ⋮ Improvements of algebraic attacks for solving the rank decoding and MinRank problems ⋮ Statistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge ⋮ Cryptanalysis of a code-based full-time signature ⋮ A multivariate cryptosystem inspired by random linear codes ⋮ A gapless code-based hash proof system based on RQC and its applications ⋮ Rank-Metric Codes and Their Applications ⋮ Classical and quantum algorithms for generic syndrome decoding problems and applications to the Lee metric ⋮ An algebraic approach to the rank support learning problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree \((1,1)\): algorithms and complexity
- Security analysis of word problem-based cryptosystems
- Theory of codes with maximum rank distance
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- 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
- Key recovery attack for ZHFE
- A survey on signature-based algorithms for computing Gröbner bases
- New technique for decoding codes in the rank metric and its cryptography applications
- Durandal: a rank metric based signature scheme
- On the complexity of ``Superdetermined minrank instances
- On the complexity of the \(F_5\) Gröbner basis algorithm
- Sparse Gaussian Elimination Modulo p: An Update
- Solving Degree and Degree of Regularity for Polynomial Systems over a Finite Fields
- RankSign: An Efficient Signature Algorithm Based on the Rank Metric
- 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
- GBLA
- The Degree of Regularity of HFE Systems
- Powers of tensors and fast matrix multiplication
- Cryptanalysis of MinRank
- Triangular Factorization and Inversion by Fast Matrix Multiplication
- Degree of Regularity for HFEv and HFEv-
- New Results for Rank-Based Cryptography
- Inverting HFE Systems Is Quasi-Polynomial for All Fields
- Comparison Between XL and Gröbner Basis Algorithms
- Progress in Cryptology – Mycrypt 2005
- Inverting HFE Is Quasipolynomial
This page was built for publication: An algebraic attack on rank metric code-based cryptosystems
