← all papers · overview

Recovering short secret keys of RLCE in polynomial time

Abstract

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 recovers the secret key for all the short key parameters proposed by the author.

Related papers

Ranked by semantic similarity — how closely each paper's abstract matches this one (100% = near-identical topic).