Extending Coggia-Couvreur attack on Loidreau's rank-metric cryptosystem
From MaRDI portal
Publication:2068390
DOI10.1007/s10623-021-00972-7zbMath1487.94190arXiv2007.07354OpenAlexW3217304927MaRDI QIDQ2068390
Publication date: 19 January 2022
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.07354
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Other types of codes (94B60)
Related Items (3)
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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Theory of codes with maximum rank distance
- Bilinear forms over a finite field, with applications to coding theory
- Polynomial-time key recovery attack on the Faure-Loidreau scheme based on Gabidulin codes
- A new rank metric codes based encryption scheme
- Fast decoding of Gabidulin codes
- LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding
- On the security of a Loidreau rank metric code based encryption scheme
- Structural attacks for public key cryptosystems based on Gabidulin codes
- Modern Computer Algebra
- On the size of Kakeya sets in finite fields
- Factorization of Multivariate Polynomials Over Finite Fields
- Coding and Cryptography
- Coding and Cryptography
This page was built for publication: Extending Coggia-Couvreur attack on Loidreau's rank-metric cryptosystem