You are looking at a specific version 20100511:202452 of this paper.
See the latest version.
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)
- 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