Column scrambler for the GPT cryptosystem
From MaRDI portal
Publication:1811105
DOI10.1016/S0166-218X(02)00446-8zbMath1022.94012MaRDI QIDQ1811105
A. V. Ourivski, Ernst M. Gabidulin
Publication date: 10 June 2003
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items (7)
Enhanced public key security for the McEliece cryptosystem ⋮ Further results on LCD generalized Gabidulin codes ⋮ Structural attacks for public key cryptosystems based on Gabidulin codes ⋮ A new McEliece-type cryptosystem using Gabidulin-Kronecker product codes ⋮ Attacks and counter-attacks on the GPT public key cryptosystem ⋮ New rank codes based encryption scheme using partial circulant matrices ⋮ Rank-Metric Codes and Their Applications
Uses Software
Cites Work
- Unnamed Item
- Theory of codes with maximum rank distance
- Severely denting the Gabidulin version of the McEliece public key cryptosystem
- The Security of the Gabidulin Public Key Cryptosystem
- A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511
This page was built for publication: Column scrambler for the GPT cryptosystem