14 citations · 14 across the 2 of their papers we have counts for
4 papers
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…
Ternary Syndrome Decoding with Large Weight
Rémi Bricout, André Chailloux, Thomas Debris-Alazard +1
The Syndrome Decoding problem is at the core of many code-based cryptosystems. In this paper, we study ternary Syndrome Decoding in large weight. This problem has been introduced i…
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…
Attack on the Edon-K Key Encapsulation Mechanism
Matthieu Lequesne, Jean-Pierre Tillich
The key encapsulation mechanism Edon-K was proposed in response to the call for post-quantum cryptography standardization issued by the National Institute of Standards and Technolo…