Severely denting the Gabidulin version of the McEliece public key cryptosystem

DOI10.1007/BF01390769zbMath0837.94018MaRDI QIDQ1894268

J. K. Gibson

Publication date: 21 May 1996

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

zbMATH Keywords

trapdoormaximum rank distance codesMcEliece public key cryptosystem

Mathematics Subject Classification ID

Cryptography (94A60) Theory of error-correcting codes and error-detecting codes (94B99)

Related Items (16)

Polynomial-time key recovery attack on the Faure-Loidreau scheme based on Gabidulin codes ⋮ Improved cryptanalysis of rank metric schemes based on Gabidulin codes ⋮ Unnamed Item ⋮ Cardinal rank metric codes over Galois rings ⋮ McEliece-type encryption based on Gabidulin codes with no hidden structure ⋮ Structural attacks for public key cryptosystems based on Gabidulin codes ⋮ Extension of Overbeck's attack for Gabidulin-based cryptosystems ⋮ A new McEliece-type cryptosystem using Gabidulin-Kronecker product codes ⋮ Modified Niederreiter type of GPT cryptosystem based on reducible rank codes ⋮ Asymptotic behaviour of codes in rank metric over finite fields ⋮ Attacks and counter-attacks on the GPT public key cryptosystem ⋮ Column scrambler for the GPT cryptosystem ⋮ New rank codes based encryption scheme using partial circulant matrices ⋮ How to mask the structure of codes for a cryptographic use ⋮ Rank-Metric Codes and Their Applications ⋮ A Novel Niederreiter-like cryptosystem based on the (u|u + υ)-construction codes

Uses Software

• McEliece

Cites Work

• Theory of codes with maximum rank distance
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Severely denting the Gabidulin version of the McEliece public key cryptosystem