Progress in Cryptology – Mycrypt 2005

DOI10.1007/11554868zbMath1126.94335OpenAlexW2496916788MaRDI QIDQ5491470

R. Overbeck

Publication date: 5 October 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11554868

zbMATH Keywords

public key cryptographyGabidulin codesrank distance codescode based cryptography

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (17)

Polynomial-time key recovery attack on the Faure-Loidreau scheme based on Gabidulin codes ⋮ Improved cryptanalysis of rank metric schemes based on Gabidulin codes ⋮ Revisiting algebraic attacks on MinRank and on the rank decoding problem ⋮ Distinguishing and recovering generalized linearized Reed-Solomon codes ⋮ 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 ⋮ Improvements of algebraic attacks for solving the rank decoding and MinRank problems ⋮ Modified Niederreiter type of GPT cryptosystem based on reducible rank codes ⋮ A modified Dual-Ouroboros public-key encryption using 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 ⋮ An algebraic attack on rank metric code-based cryptosystems ⋮ Cryptanalysis of a system based on twisted Reed-Solomon codes ⋮ Rank-Metric Codes and Their Applications ⋮ A Novel Niederreiter-like cryptosystem based on the (u|u + υ)-construction codes ⋮ An algebraic approach to the rank support learning problem

This page was built for publication: Progress in Cryptology – Mycrypt 2005