Extension of Overbeck's attack for Gabidulin-based cryptosystems
From MaRDI portal
Publication:1696047
DOI10.1007/s10623-017-0343-7zbMath1412.94179arXiv1511.01549OpenAlexW2963379327MaRDI QIDQ1696047
Kyle Marshall, Anna-Lena Horlemann-Trautmann, Joachim Rosenthal
Publication date: 14 February 2018
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.01549
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items
On the security of the modified dual-Ouroboros PKE using Gabidulin codes, Improved cryptanalysis of rank metric schemes based on Gabidulin codes, Security analysis of a cryptosystem based on subspace subcodes, On \(q\)-Steiner systems from rank metric codes, New criteria for MRD and Gabidulin codes and some rank-metric code constructions, Systematic maximum sum rank codes, Cryptanalysis and repair of a Gabidulin code based cryptosystem from ACISP 2018, Distinguishing and recovering generalized linearized Reed-Solomon codes, McEliece-type encryption based on Gabidulin codes with no hidden structure, Equivalence and characterizations of linear rank-metric codes based on invariants, A new McEliece-type cryptosystem using Gabidulin-Kronecker product codes, New rank codes based encryption scheme using partial circulant matrices, Rank-Metric Codes and Their Applications, A Novel Niederreiter-like cryptosystem based on the (u|u + υ)-construction codes
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Galois invariance, trace codes and subfield subcodes
- Attacks and counter-attacks on the GPT public key cryptosystem
- Theory of codes with maximum rank distance
- New technique for decoding codes in the rank metric and its cryptography applications
- Severely denting the Gabidulin version of the McEliece public key cryptosystem
- Fast decoding of Gabidulin codes
- New criteria for MRD and Gabidulin codes and some rank-metric code constructions
- Structural attacks for public key cryptosystems based on Gabidulin codes
- On the Complexity of the Rank Syndrome Decoding Problem
- Equivalence for Rank-Metric and Matrix Codes and Automorphism Groups of Gabidulin Codes
- Isometries for rank distance and permutation group of gabidulin codes
- Designing a Rank Metric Based McEliece Cryptosystem
- On the edge-independence number and edge-covering number for regular graphs
- New Results for Rank-Based Cryptography
- Bounds on List Decoding of Rank-Metric Codes
