[Resource Topic] 2010/271: Selecting Parameters for Secure McEliece-based Cryptosystems

Welcome to the resource topic for 2010/271

Selecting Parameters for Secure McEliece-based Cryptosystems

Authors: Robert Niebuhr, Mohammed Meziani, Stanislav Bulygin, Johannes Buchmann


In 1994, P. Shor showed that quantum computers will be able to break cryptosystems based on integer factorization and on the discrete logarithm, e.g. RSA or ECC. Code-based crytosystems are promising alternatives to public key schemes based on these problems, and they are believed to be secure against quantum computer attacks. In this paper, we solve the problem of selecting optimal parameters for the McEliece cryptosystem that provide security until a given year and give detailed recommendations. Our analysis is based on the lower bound complexity estimates by Sendrier and Finiasz, and the security requirements model proposed by Lenstra and Verheul.

ePrint: https://eprint.iacr.org/2010/271

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 .