52 citations · 134 across the 30 of their papers we have counts for
13 papers · 1 filter
An extension of Overbeck's attack with an application to cryptanalysis of Twisted Gabidulin-based schemes
Alain Couvreur, Ilaria Zappatore
In this article, we discuss the decoding of Gabidulin and related codes from a cryptographic point of view, and we observe that these codes can be decoded solely from the knowledge…
Correlated Pseudorandomness from the Hardness of Quasi-Abelian Decoding
Maxime Bombar, Geoffroy Couteau, Alain Couvreur +1
Secure computation often benefits from the use of correlated randomness to achieve fast, non-cryptographic online protocols. A recent paradigm put forth by Boyle …
A new approach based on quadratic forms to attack the McEliece cryptosystem
Alain Couvreur, Rocco Mora, Jean-Pierre Tillich
We bring in here a novel algebraic approach for attacking the McEliece cryptosystem. It consists in introducing a subspace of matrices representing quadratic forms. Those are assoc…
On Codes and Learning With Errors over Function Fields
Maxime Bombar, Alain Couvreur, Thomas Debris-Alazard
It is a long standing open problem to find search to decision reductions for structured versions of the decoding problem of linear codes. Such results in the lattice-based setting…
Decoding supercodes of Gabidulin codes and applications to cryptanalysis
Maxime Bombar, Alain Couvreur
This article discusses the decoding of Gabidulin codes and shows how to extend the usual decoder to any supercode of a Gabidulin code at the cost of a significant decrease of the d…
Recovering or Testing Extended-Affine Equivalence
Anne Canteaut, Alain Couvreur, Léo Perrin
Extended Affine (EA) equivalence is the equivalence relation between two vectorial Boolean functions and such that there exist two affine permutations , , and an affi…
On the security of subspace subcodes of Reed-Solomon codes for public key encryption
Alain Couvreur, Matthieu Lequesne
This article discusses the security of McEliece-like encryption schemes using subspace subcodes of Reed-Solomon codes, i.e. subcodes of Reed-Solomon codes over w…
Practical Algebraic Attack on DAGS
Magali Bardet, Manon Bertin, Alain Couvreur +1
DAGS scheme is a key encapsulation mechanism (KEM) based on quasi-dyadic alternant codes that was submitted to NIST standardization process for a quantum resistant public key algor…
Recovering short secret keys of RLCE in polynomial time
Alain Couvreur, Matthieu Lequesne, Jean-Pierre Tillich
We present a key recovery attack against Y. Wang's Random Linear Code Encryption (RLCE) scheme recently submitted to the NIST call for post-quantum cryptography. This attack recove…
An efficient structural attack on NIST submission DAGS
Elise Barelli, Alain Couvreur
We present an efficient key recovery attack on code based encryption schemes using some quasi-dyadic alternant codes with extension degree 2. This attack permits to break the propo…
A Polynomial-Time Attack on the BBCRS Scheme
Alain Couvreur, Ayoub Otmani, Jean-Pierre Tillich +1
The BBCRS scheme is a variant of the McEliece public-key encryption scheme where the hiding phase is performed by taking the inverse of a matrix which is of the form $\mathbf{T} +\…
Polynomial Time Attack on Wild McEliece Over Quadratic Extensions
Alain Couvreur, Ayoub Otmani, Jean-Pierre Tillich
We present a polynomial time structural attack against the McEliece system based on Wild Goppa codes from a quadratic finite field extension. This attack uses the fact that such co…
Distinguisher-Based Attacks on Public-Key Cryptosystems Using Reed-Solomon Codes
Alain Couvreur, Philippe Gaborit, Valérie Gauthier-Umaña +2
Because of their interesting algebraic properties, several authors promote the use of generalized Reed-Solomon codes in cryptography. Niederreiter was the first to suggest an insta…