CRITMay 29, 2018

Recovering short secret keys of RLCE in polynomial time

arXiv:1805.11489v120 citations
Originality Synthesis-oriented
AI Analysis

This work exposes a critical vulnerability in a candidate post-quantum cryptography scheme, potentially impacting its security and standardization efforts.

The authors developed a key recovery attack against the RLCE post-quantum encryption scheme, successfully recovering secret keys for all short key parameters proposed by Wang.

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.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes