Selecting parameters for secure McEliece-based cryptosystems
Authors / Editors
Research Areas
No matching items found.
Publication Details
Output type: Journal article
Author list: Niebuhr R, Meziani M, Bulygin S, Buchmann J
Publisher: Springer
Publication year: 2012
Journal: International Journal of Information Security (1615-5262)
Volume number: 11
Issue number: 3
Start page: 137
End page: 147
Number of pages: 11
ISSN: 1615-5262
eISSN: 1615-5270
Languages: English-Great Britain (EN-GB)
Unpaywall Data
Open access status: green
Full text URL: http://eprint.iacr.org/2010/271.pdf
Abstract
In 1994, Shor showed that quantum computers will be able to break cryptosystems based on the problems of integer factorization and the discrete logarithm, for example, RSA or ECC. Code-based cryptosystems are promising alternatives to public-key schemes built 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 are expected to provide security at least 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. This security model uses assumptions about Moore's Law and other developments in order to estimate the attained security level for a given year.
Keywords
Codes, Key length, McEliece, Moore's Law, Parameters, Post-quantum cryptography
Documents
No matching items found.
