Evolution of the McEliece Public Key Encryption Scheme

6Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The evolution of the McEliece encryption scheme is a long and thrilling research process. The code families supposed to securely reduce the key size of the original scheme were often cryptanalyzed and thus the future of the code-based cryptography was many times doubted. Yet from this long evolution emerged a great comprehension and understanding of the main difficulties and advantages that coding theory can offer to the field of public key cryptography. Nowadays code-based cryptography has become one of the most promising solutions to post-quantum cryptography. We analyze in this article the evolution of the main encryption variants coming from this field. We stress out the main security issues and point out some new ideas coming from the Rank based cryptography. A summary of the remaining secure variants is given in Fig., 2.

Cite

CITATION STYLE

APA

Bucerzan, D., Dragoi, V., & Kalachi, H. T. (2017). Evolution of the McEliece Public Key Encryption Scheme. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10543 LNCS, pp. 129–149). Springer Verlag. https://doi.org/10.1007/978-3-319-69284-5_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free