Designing a Rank Metric Based McEliece Cryptosystem

DOI10.1007/978-3-642-12929-2_11zbMath1284.94089OpenAlexW1662906987MaRDI QIDQ3569143

Pierre Loidreau

Publication date: 17 June 2010

Published in: Post-Quantum Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-12929-2_11

Mathematics Subject Classification ID

Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (10)

Polynomial-time key recovery attack on the Faure-Loidreau scheme based on Gabidulin codes ⋮ Improved cryptanalysis of rank metric schemes based on Gabidulin codes ⋮ Security analysis of a cryptosystem based on subspace subcodes ⋮ New criteria for MRD and Gabidulin codes and some rank-metric code constructions ⋮ Extension of Overbeck's attack for Gabidulin-based cryptosystems ⋮ Unnamed Item ⋮ Asymptotic behaviour of codes in rank metric over finite fields ⋮ Systematic encoders for generalized Gabidulin codes and the \(q\)-analogue of Cauchy matrices ⋮ New rank codes based encryption scheme using partial circulant matrices ⋮ Rank-Metric Codes and Their Applications

Uses Software

• McEliece

This page was built for publication: Designing a Rank Metric Based McEliece Cryptosystem