Cryptology ePrint Archive: Report 2017/757

CAKE: Code-based Algorithm for Key Encapsulation

Paulo S. L. M. Barreto and Shay Gueron and Tim Gueneysu and Rafael Misoczki and Edoardo Persichetti and Nicolas Sendrier and Jean-Pierre Tillich

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.

Category / Keywords: public-key cryptography / KEM, Code-based, MDPC

Date: received 1 Aug 2017, last revised 23 Oct 2017

Contact author: rafa misoczki at gmail com

Available format(s): PDF | BibTeX Citation

Note: To appear at IMACC 2017

Version: 20171023:151502 (All versions of this report)

Short URL: ia.cr/2017/757

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]