Evolution of the McEliece Public Key Encryption Scheme

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...

Full description

Saved in:
Bibliographic Details
Published inInnovative Security Solutions for Information Technology and Communications Vol. 10543; pp. 129 - 149
Main Authors Bucerzan, Dominic, Dragoi, Vlad, Kalachi, Hervé Talé
Format Book Chapter
LanguageEnglish
Published Switzerland Springer International Publishing AG 2017
Springer International Publishing
SeriesLecture Notes in Computer Science
Subjects
Online AccessGet full text
ISBN3319692836
9783319692838
ISSN0302-9743
1611-3349
DOI10.1007/978-3-319-69284-5_10

Cover

More Information
Summary: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.
ISBN:3319692836
9783319692838
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-319-69284-5_10