CryptoDB
Selecting Parameters for Secure McEliece-based Cryptosystems
| Authors: | |
|---|---|
| Download: | |
| 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. |
BibTeX
@misc{eprint-2010-23172,
title={Selecting Parameters for Secure McEliece-based Cryptosystems},
booktitle={IACR Eprint archive},
keywords={Post-Qunatum Cryptography},
url={http://eprint.iacr.org/2010/271},
note={the paper has been never published elsewhere mohammed.meziani@cased.de 14739 received 10 May 2010},
author={Robert Niebuhr and Mohammed Meziani and Stanislav Bulygin and Johannes Buchmann},
year=2010
}