Paper 2010/271

Selecting Parameters for Secure McEliece-based Cryptosystems

Robert Niebuhr, Mohammed Meziani, Stanislav Bulygin, and 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.

Available format(s)
Publication info
Published elsewhere. the paper has been never published elsewhere
Post-Qunatum Cryptography
Contact author(s)
mohammed meziani @ cased de
2010-05-11: received
Short URL
Creative Commons Attribution


      author = {Robert Niebuhr and Mohammed Meziani and Stanislav Bulygin and Johannes Buchmann},
      title = {Selecting Parameters for Secure McEliece-based Cryptosystems},
      howpublished = {Cryptology ePrint Archive, Paper 2010/271},
      year = {2010},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.