Structural attacks for public key cryptosystems based on Gabidulin codes
From MaRDI portal
Publication:2425529
DOI10.1007/S00145-007-9003-9zbMATH Open1159.94009DBLPjournals/joc/Overbeck08OpenAlexW2094420277WikidataQ59487317 ScholiaQ59487317MaRDI QIDQ2425529FDOQ2425529
Publication date: 6 May 2008
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-007-9003-9
linear codespublic key cryptographyGabidulin codesrank distanceGabidulin-Paramonov-Tretjakov variant of the McEliece cryptosystem
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Column scrambler for the GPT cryptosystem
- How to mask the structure of codes for a cryptographic use
- New technique for decoding codes in the rank metric and its cryptography applications
- Progress in Cryptology β Mycrypt 2005
- Severely denting the Gabidulin version of the McEliece public key cryptosystem
- The Security of the Gabidulin Public Key Cryptosystem
- Reducible rank codes and their applications to cryptography
- Coding and Cryptography
- How Much Does a Matrix of Rank k Weigh?
Cited In (42)
- On the security of the modified dual-Ouroboros PKE using Gabidulin codes
- Modified Niederreiter type of GPT cryptosystem based on reducible rank codes
- Constructions of optimal rank-metric codes from automorphisms of rational function fields
- List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques
- Identifiers for MRD-codes
- Theory of supports for linear codes endowed with the sum-rank metric
- Enhanced public key security for the McEliece cryptosystem
- Asymptotic behaviour of codes in rank metric over finite fields
- Extension of Overbeck's attack for Gabidulin-based cryptosystems
- On the rank decoding problem over finite principal ideal rings
- Extending two families of maximum rank distance codes
- Fast decoding of lifted interleaved linearized Reed-Solomon codes for multishot network coding
- A modified Dual-Ouroboros public-key encryption using Gabidulin codes
- Automating the functional correspondence between higher-order evaluators and abstract machines
- An upper-bound on the decoding failure probability of the LRPC decoder
- Improved cryptanalysis of rank metric schemes based on Gabidulin codes
- Two modifications for Loidreau's code-based cryptosystem
- Constructions of rank metric codes under actions of the unitary groups
- New rank codes based encryption scheme using partial circulant matrices
- Systematic encoders for generalized Gabidulin codes and the \(q\)-analogue of Cauchy matrices
- Cryptanalysis of Ivanov-Krouk-Zyablov cryptosystem
- Extending Coggia-Couvreur attack on Loidreau's rank-metric cryptosystem
- Polynomial-time key recovery attack on the Faure-Loidreau scheme based on Gabidulin codes
- Attacks and counter-attacks on the GPT public key cryptosystem
- Rank-Metric Codes and Their Applications
- Injective rank metric trapdoor functions with homogeneous errors
- On the security of a Loidreau rank metric code based encryption scheme
- LRPC codes with multiple syndromes: near ideal-size KEMs without ideals
- A Novel Niederreiter-like cryptosystem based on the (u|u + Ο )-construction codes
- Maximum weight codewords of a linear rank-metric code
- Security analysis of a cryptosystem based on subspace subcodes
- A new McEliece-type cryptosystem using Gabidulin-Kronecker product codes
- Cryptanalysis and repair of a Gabidulin code based cryptosystem from ACISP 2018
- Severely denting the Gabidulin version of the McEliece public key cryptosystem
- On the list decodability of self-orthogonal rank-metric codes
- LowMS: a new rank metric code-based KEM without ideal structure
- Equivalence and characterizations of linear rank-metric codes based on invariants
- Roos bound for skew cyclic codes in Hamming and rank metric
- On the security of REDOG
- Theoretical analysis of decoding failure rate of non-binary QC-MDPC codes
- Distinguishing and recovering generalized linearized Reed-Solomon codes
- McEliece-type encryption based on Gabidulin codes with no hidden structure
Uses Software
Recommendations
- Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes π π
- Extension of Overbeck's attack for Gabidulin-based cryptosystems π π
- On the security of the modified dual-Ouroboros PKE using Gabidulin codes π π
- Attacks and counter-attacks on the GPT public key cryptosystem π π
- Severely denting the Gabidulin version of the McEliece public key cryptosystem π π
- The Security of the Gabidulin Public Key Cryptosystem π π
- Improved cryptanalysis of rank metric schemes based on Gabidulin codes π π
- Polynomial-time key recovery attack on the Faure-Loidreau scheme based on Gabidulin codes π π
- A new Gabidulin-like code and its application in cryptography π π
- Cryptanalysis and repair of a Gabidulin code based cryptosystem from ACISP 2018 π π
This page was built for publication: Structural attacks for public key cryptosystems based on Gabidulin codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2425529)
