Reducible rank codes and their applications to cryptography

DOI10.1109/TIT.2003.820038zbMath1286.94067MaRDI QIDQ3546907

Bahram Honary, Bassem Ammar, A. V. Ourivski, Ernst M. Gabidulin

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (17)

A Summary of McEliece-Type Cryptosystems and their Security ⋮ Polynomial-time key recovery attack on the Faure-Loidreau scheme based on Gabidulin codes ⋮ Improved cryptanalysis of rank metric schemes based on Gabidulin codes ⋮ Cryptanalysis and repair of a Gabidulin code based cryptosystem from ACISP 2018 ⋮ McEliece-type encryption based on Gabidulin codes with no hidden structure ⋮ Structural attacks for public key cryptosystems based on Gabidulin codes ⋮ 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 ⋮ Universal secure rank-metric coding schemes with optimal communication overheads ⋮ On the reconstruction of linearized polynomials: a new decoding algorithm for Gabidulin codes. ⋮ LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding ⋮ 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 ⋮ Construction of LCD-MRD codes of length n > N ⋮ A Novel Niederreiter-like cryptosystem based on the (u|u + υ)-construction codes

This page was built for publication: Reducible rank codes and their applications to cryptography