Attacks and counter-attacks on the GPT public key cryptosystem
From MaRDI portal
Publication:1009035
DOI10.1007/s10623-007-9160-8zbMath1196.94050OpenAlexW2011881257MaRDI QIDQ1009035
Publication date: 31 March 2009
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-007-9160-8
Related Items (10)
Polynomial-time key recovery attack on the Faure-Loidreau scheme based on Gabidulin codes ⋮ Improved cryptanalysis of rank metric schemes based on Gabidulin codes ⋮ Security analysis of a cryptosystem based on subspace subcodes ⋮ LRPC codes with multiple syndromes: near ideal-size KEMs without ideals ⋮ Distinguishing and recovering generalized linearized Reed-Solomon codes ⋮ McEliece-type encryption based on Gabidulin codes with no hidden structure ⋮ Extension of Overbeck's attack for Gabidulin-based cryptosystems ⋮ Modified Niederreiter type of GPT cryptosystem based on reducible rank codes ⋮ 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
- Theory of codes with maximum rank distance
- Column scrambler for the GPT cryptosystem
- 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
- Progress in Cryptology – Mycrypt 2005
This page was built for publication: Attacks and counter-attacks on the GPT public key cryptosystem