On the security of a Loidreau rank metric code based encryption scheme

DOI10.1007/s10623-020-00781-4zbMath1453.94163arXiv1903.02933OpenAlexW2995917189WikidataQ123015399 ScholiaQ123015399MaRDI QIDQ2200523

Daniel Coggia, Alain Couvreur

Publication date: 22 September 2020

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1903.02933

zbMATH Keywords

cryptanalysisGabidulin codesrank metric codescode based cryptography

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Bounds on codes (94B65) Polynomials over finite fields (11T06)

Related Items (6)

Extending two families of maximum rank distance codes ⋮ Cryptanalysis and repair of a Gabidulin code based cryptosystem from ACISP 2018 ⋮ McEliece-type encryption based on Gabidulin codes with no hidden structure ⋮ A new McEliece-type cryptosystem using Gabidulin-Kronecker product codes ⋮ Extending Coggia-Couvreur attack on Loidreau's rank-metric cryptosystem ⋮ Decoding supercodes of Gabidulin codes and applications to cryptanalysis

Uses Software

• Magma
• McEliece

Cites Work

• Unnamed Item
• Enhanced public key security for the McEliece cryptosystem
• Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes
• Theory of codes with maximum rank distance
• Bilinear forms over a finite field, with applications to coding theory
• The Magma algebra system. I: The user language
• A new rank metric codes based encryption scheme
• Structural attacks for public key cryptosystems based on Gabidulin codes
• A Polynomial-Time Attack on the BBCRS Scheme
• Isometries for rank distance and permutation group of gabidulin codes
• A Distinguisher for High-Rate McEliece Cryptosystems
• Coding and Cryptography

This page was built for publication: On the security of a Loidreau rank metric code based encryption scheme