Structural attacks for public key cryptosystems based on Gabidulin codes
From MaRDI portal
Publication:2425529
The author presents a new attack on the Gabidulin-Paramonov-Tretjakov variant of the McEliece cryptosystem. This variant uses codes in the rank metric which was introduced by Gabidulin. Section 1 is introductory. In Section 2, the author introduces the rank metric for linear codes. In Section 3, he describes the Gabidulin-Paramonov-Tretjakov (GPT) variant of the McEliece cryptosystem. Section 4 surveys the so-called structural attacks on such cryptosystems. In sections 5 and 6, the author develops a new powerful attack and argues that it is not possible to avoid this attack by using subfield codes of the Gabidulin codes. He concludes that none of the existing GPT variants is secure for parameters that are of practical interest.
Recommendations
- The security of the Gabidulin public key cryptosystem
- Cryptanalysis and repair of a Gabidulin code based cryptosystem from ACISP 2018
- Extension of Overbeck's attack for Gabidulin-based cryptosystems
- Polynomial-time key recovery attack on the Faure-Loidreau scheme based on Gabidulin codes
- Severely denting the Gabidulin version of the McEliece public key cryptosystem
- A new Gabidulin-like code and its application in cryptography
- Attacks and counter-attacks on the GPT public key cryptosystem
- Improved cryptanalysis of rank metric schemes based on Gabidulin codes
- On the security of the modified dual-Ouroboros PKE using Gabidulin codes
- Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes
Cites work
- Coding and Cryptography
- Column scrambler for the GPT cryptosystem
- How Much Does a Matrix of Rank k Weigh?
- How to mask the structure of codes for a cryptographic use
- scientific article; zbMATH DE number 177612 (Why is no real title available?)
- scientific article; zbMATH DE number 2018401 (Why is no real title available?)
- scientific article; zbMATH DE number 2081064 (Why is no real title available?)
- scientific article; zbMATH DE number 2154122 (Why is no real title available?)
- New technique for decoding codes in the rank metric and its cryptography applications
- Progress in Cryptology – Mycrypt 2005
- Reducible rank codes and their applications to cryptography
- Severely denting the Gabidulin version of the McEliece public key cryptosystem
- The security of the Gabidulin public key cryptosystem
Cited in
(63)- Attacks and counter-attacks on the GPT public key cryptosystem
- Polynomial-time key recovery attack on the Faure-Loidreau scheme based on Gabidulin codes
- Improved cryptanalysis of rank metric schemes based on Gabidulin codes
- Extension of Overbeck's attack for Gabidulin-based cryptosystems
- Gabidulin matrix codes and their application to small ciphertext size cryptosystems
- On the list decodability of self-orthogonal rank-metric codes
- Column scrambler for the GPT cryptosystem
- Severely denting the Gabidulin version of the McEliece public key cryptosystem
- Roos bound for skew cyclic codes in Hamming and rank metric
- A modified Dual-Ouroboros public-key encryption using Gabidulin codes
- Extending Coggia-Couvreur attack on Loidreau's rank-metric cryptosystem
- Constructions of rank metric codes under actions of the unitary groups
- Extending two families of maximum rank distance codes
- Security analysis of a cryptosystem based on subspace subcodes
- Equivalence and characterizations of linear rank-metric codes based on invariants
- On the security of a Loidreau rank metric code based encryption scheme
- Systematic encoders for generalized Gabidulin codes and the \(q\)-analogue of Cauchy matrices
- Theory of supports for linear codes endowed with the sum-rank metric
- A new Gabidulin-like code and its application in cryptography
- New rank codes based encryption scheme using partial circulant matrices
- Identifiers for MRD-codes
- Modified Niederreiter type of GPT cryptosystem based on reducible rank codes
- Asymptotic behaviour of codes in rank metric over finite fields
- How to mask the structure of codes for a cryptographic use
- Enhanced public key security for the McEliece cryptosystem
- The security of the Gabidulin public key cryptosystem
- List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques
- A novel Niederreiter-like cryptosystem based on the \((u|u + \upsilon)\)-construction codes
- Progress in Cryptology – Mycrypt 2005
- Rank-metric codes and their applications
- Coding and Cryptography
- Automating the functional correspondence between higher-order evaluators and abstract machines
- Cryptanalysis and repair of a Gabidulin code based cryptosystem from ACISP 2018
- LRPC codes with multiple syndromes: near ideal-size KEMs without ideals
- Constructions of optimal rank-metric codes from automorphisms of rational function fields
- Distinguishing and recovering generalized linearized Reed-Solomon codes
- McEliece-type encryption based on Gabidulin codes with no hidden structure
- Cryptanalysis of Ivanov-Krouk-Zyablov cryptosystem
- A new McEliece-type cryptosystem using Gabidulin-Kronecker product codes
- An extension of Overbeck's attack with an application to cryptanalysis of Twisted Gabidulin-based schemes
- LowMS: a new rank metric code-based KEM without ideal structure
- On the security of REDOG
- Theoretical analysis of decoding failure rate of non-binary QC-MDPC codes
- On the rank decoding problem over finite principal ideal rings
- Fast decoding of lifted interleaved linearized Reed-Solomon codes for multishot network coding
- An upper-bound on the decoding failure probability of the LRPC decoder
- Two modifications for Loidreau's code-based cryptosystem
- Injective rank metric trapdoor functions with homogeneous errors
- Maximum weight codewords of a linear rank-metric code
- Fast decoding of interleaved linearized Reed-Solomon codes and variants
- Security assessment of the LG cryptosystem
- A geometric invariant of linear rank-metric codes
- Low-rank parity-check codes over finite commutative rings
- Somewhat homomorphic encryption based on random codes
- MinRank Gabidulin encryption scheme on matrix codes
- Analysis of REDOG: the Pad Thai attack
- The complexity of the SupportMinors Modeling for the MinRank problem
- Key attack on the ACDGV matrix encryption scheme
- Public-key encryption from the MinRank problem
- A minrank-based encryption scheme à la Alekhnovich-Regev
- Linearized polynomial Chinese remainder codes
- Analysis of layered ROLLO-I: a BII-LRPC code-based KEM
- On the security of the modified dual-Ouroboros PKE using Gabidulin codes
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)
