activity
20062021
most citedProperties of codes in rank metric

41 citations · 91 across the 6 of their papers we have counts for

collaborators

7 papers

cs.CR2021★ 1 cited

An analysis of Coggia-Couvreur attack on Loidreau's rank-metric public key encryption scheme in the general case

Pierre Loidreau, Ba-Duc Pham

In this paper we show that in the case where the public-key can be distinguished from a random code in Loidreau's encryption scheme, then Coggia-Couvreur attack can be extended to…

cs.CR2019★ 6 cited

RAMESSES, a Rank Metric Encryption Scheme with Short Keys

Julien Lavauzelle, Pierre Loidreau, Ba-Duc Pham

We present a rank metric code-based encryption scheme with key and ciphertext sizes comparable to that of isogeny-based cryptography for an equivalent security level. The system al…

cs.IT2019

Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius

Julian Renner, Thomas Jerkovits, Hannes Bartz +3

We address the problem of decoding Gabidulin codes beyond their unique error-correction radius. The complexity of this problem is of importance to assess the security of some rank-…

cs.IT2017★ 2 cited

Generalized Gabidulin codes over fields of any characteristic

Daniel Augot, Pierre Loidreau, Gwezheneg Robert

We generalise Gabidulin codes to the case of infinite fields, eventually with characteristic zero. For this purpose, we consider an abstract field extension and any automorphism in…

cs.IT2013★ 38 cited

Rank metric and Gabidulin codes in characteristic zero

Gwezheneg Robert, Pierre Loidreau, Daniel Augot

We transpose the theory of rank metric and Gabidulin codes to the case of fields of characteristic zero. The Frobenius automorphism is then replaced by any element of the Galois gr…

cs.DM2006★ 41 cited

Properties of codes in rank metric

P. Loidreau

We study properties of rank metric and codes in rank metric over finite fields. We show that in rank metric perfect codes do not exist. We derive an existence bound that is the equ…

cs.IT2006★ 3 cited

Properties of subspace subcodes of optimum codes in rank metric

E. M. Gabidulin, P. Loidreau

Maximum rank distance codes denoted MRD-codes are the equivalent in rank metric of MDS-codes. Given any integer power of a prime and any integer there is a family of MRD-co…