CAKE: Code-Based Algorithm for Key Encapsulation

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

Abstract

Current widely-used key exchange (KE) mechanisms will be vulnerable to quantum attacks when sufficiently strong quantum computers become available. Therefore, devising quantum-resistant replacements that combine efficiency with solid security guarantees is an important and challenging task. This paper proposes several contributions towards this goal. First, we introduce “CAKE”, a key encapsulation algorithm based on the QC-MDPC McEliece encryption scheme, with two major improvements: (a) the use of ephemeral keys that defeats a recent reaction attack against MDPC decoding of the corresponding encryption scheme and (b) a highly efficient key generation procedure for QC-MDPC-based cryptosystems. Then, we present an authenticated key exchange protocol based on CAKE, which is suitable for the Internet Key Exchange (IKE) standard. We prove that CAKE is IND-CPA secure, that the protocol is SK-Secure, and suggest practical parameters. Compared to other post-quantum schemes, we believe that CAKE is a promising candidate for post-quantum key exchange standardization.

Cite

CITATION STYLE

APA

Barreto, P. S. L. M., Gueron, S., Güneysu, T., Misoczki, R., Persichetti, E., Sendrier, N., & Tillich, J. P. (2017). CAKE: Code-Based Algorithm for Key Encapsulation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10655 LNCS, pp. 207–226). Springer Verlag. https://doi.org/10.1007/978-3-319-71045-7_11

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