Recovering short secret keys of RLCE in polynomial time
classification
💻 cs.CR
cs.ITmath.IT
keywords
attackrlcesecretshortauthorcallcodecryptography
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.