Polynomial-time key recovery attack on the Faure-Loidreau scheme based on Gabidulin codes
From MaRDI portal
Publication:1647553
DOI10.1007/s10623-017-0402-0zbMath1420.94064arXiv1606.07760OpenAlexW2963026014WikidataQ62039147 ScholiaQ62039147MaRDI QIDQ1647553
Philippe Gaborit, Hervé Talé Kalachi, Ayoub Otmani
Publication date: 26 June 2018
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.07760
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items (7)
Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius ⋮ Cryptanalysis and repair of a Gabidulin code based cryptosystem from ACISP 2018 ⋮ A new McEliece-type cryptosystem using Gabidulin-Kronecker product codes ⋮ LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding ⋮ Partition-balanced families of codes and asymptotic enumeration in coding theory ⋮ Extending Coggia-Couvreur attack on Loidreau's rank-metric cryptosystem ⋮ Decoding supercodes of Gabidulin codes and applications to cryptanalysis
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes
- Attacks and counter-attacks on the GPT public key cryptosystem
- Theory of codes with maximum rank distance
- Improved cryptanalysis of rank metric schemes based on Gabidulin codes
- Severely denting the Gabidulin version of the McEliece public key cryptosystem
- Structural attacks for public key cryptosystems based on Gabidulin codes
- The Security of the Gabidulin Public Key Cryptosystem
- Square Code Attack on a Modified Sidelnikov Cryptosystem
- On the Complexity of the Rank Syndrome Decoding Problem
- Isometries for rank distance and permutation group of gabidulin codes
- Reducible rank codes and their applications to cryptography
- Designing a Rank Metric Based McEliece Cryptosystem
- Polynomial Time Attack on Wild McEliece over Quadratic Extensions
- Cryptanalyzing the Polynomial-Reconstruction Based Public-Key System Under Optimal Parameter Choice
- Progress in Cryptology – Mycrypt 2005
- Coding and Cryptography
- Coding and Cryptography
- Public Key Cryptography – PKC 2004
This page was built for publication: Polynomial-time key recovery attack on the Faure-Loidreau scheme based on Gabidulin codes