52 citations · 134 across the 30 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.CR2018
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…
cs.CR2018
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…