Cryptology ePrint Archive: Report 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.

Category / Keywords: Post-Qunatum Cryptography

Publication Info: the paper has been never published elsewhere

Date: received 10 May 2010

Contact author: mohammed meziani at cased de

Available format(s): PDF | BibTeX Citation

Version: 20100511:202452 (All versions of this report)

Short URL: ia.cr/2010/271

Discussion forum: Show discussion | Start new discussion