Selecting Parameters for Secure McEliece-based Cryptosystems

Robert Niebuhr; Mohammed Meziani; Stanislav Bulygin; Johannes Buchmann

Paper 2010/271

Selecting Parameters for Secure McEliece-based Cryptosystems

Robert Niebuhr, Mohammed Meziani, Stanislav Bulygin, and Johannes Buchmann

Abstract

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.

Metadata

Available format(s): PDF
Publication info: Published elsewhere. the paper has been never published elsewhere
Keywords: Post-Qunatum Cryptography
Contact author(s): mohammed meziani @ cased de
History: 2010-05-11: received
Short URL: https://ia.cr/2010/271
License: CC BY

BibTeX

@misc{cryptoeprint:2010/271,
      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{https://eprint.iacr.org/2010/271}},
      url = {https://eprint.iacr.org/2010/271}
}