Welcome to the resource topic for 2018/528
Title:
Recovering short secret keys of RLCE in polynomial time
Authors: Alain Couvreur, Matthieu Lequesne, Jean-Pierre Tillich
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.
ePrint: https://eprint.iacr.org/2018/528
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .