Cryptanalysis of Rank-Metric Schemes Based on Distorted Gabidulin Codes
From MaRDI portal
Publication:6493381
DOI10.1007/978-3-031-40003-2_2MaRDI QIDQ6493381
Pierre Loidreau, Pierre Briaud
Publication date: 26 April 2024
Cryptography (94A60) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Quantum cryptography (quantum-theoretic aspects) (81P94)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree \((1,1)\): algorithms and complexity
- Theory of codes with maximum rank distance
- Bilinear forms over a finite field, with applications to coding theory
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- A new rank metric codes based encryption scheme
- Identity-based encryption from codes with rank metric
- New technique for decoding codes in the rank metric and its cryptography applications
- An algebraic attack on rank metric code-based cryptosystems
- An algebraic approach to the rank support learning problem
- On the security of a Loidreau rank metric code based encryption scheme
- On the complexity of ``Superdetermined minrank instances
- Improvements of algebraic attacks for solving the rank decoding and MinRank problems
- On the Complexity of the Rank Syndrome Decoding Problem
- Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
- Progress in Cryptology – Mycrypt 2005
This page was built for publication: Cryptanalysis of Rank-Metric Schemes Based on Distorted Gabidulin Codes
