Coding and Cryptography

DOI10.1007/11779360zbMath1151.94507OpenAlexW2504517155MaRDI QIDQ5899195

Cédric Faure, Pierre Loidreau

Publication date: 2 May 2007

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

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

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Cryptography (94A60)

Related Items (10)

Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius ⋮ Polynomial-time key recovery attack on the Faure-Loidreau scheme based on Gabidulin codes ⋮ Generalized Gabidulin codes over fields of any characteristic ⋮ Cryptanalysis and repair of a Gabidulin code based cryptosystem from ACISP 2018 ⋮ LRPC codes with multiple syndromes: near ideal-size KEMs without ideals ⋮ Division algebras and MRD codes from skew polynomials ⋮ LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding ⋮ Extending Coggia-Couvreur attack on Loidreau's rank-metric cryptosystem ⋮ Rank-Metric Codes and Their Applications ⋮ Decoding supercodes of Gabidulin codes and applications to cryptanalysis

This page was built for publication: Coding and Cryptography