2000 character limit reached
Recovering short secret keys of RLCE in polynomial time
Published 29 May 2018 in cs.CR, cs.IT, and math.IT | (1805.11489v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
