CRYSTALS - Kyber: a CCA-secure module-lattice-based KEM

被引:522
作者
Bos, Joppe [1 ]
Ducas, Leo [2 ]
Kiltz, Eike [3 ]
Lepoint, Tancrede [4 ]
Lyubashevsky, Vadim [5 ]
Schanck, John M. [6 ]
Schwabe, Peter [7 ]
Seiler, Gregor [5 ]
Stehle, Damien [8 ]
机构
[1] NXP Semicond, Leuven, Belgium
[2] CWI Amsterdam, Amsterdam, Netherlands
[3] Ruhr Univ Bochum, Bochum, Germany
[4] SRI Int, Menlo Pk, CA USA
[5] IBM Res Zurich, Zurich, Switzerland
[6] Univ Waterloo, Waterloo, ON, Canada
[7] Radboud Univ Nijmegen, Nijmegen, Netherlands
[8] ENS Lyon, Lyon, France
来源
2018 3RD IEEE EUROPEAN SYMPOSIUM ON SECURITY AND PRIVACY (EUROS&P 2018) | 2018年
基金
欧盟地平线“2020”; 加拿大自然科学与工程研究理事会;
关键词
EXCHANGE;
D O I
10.1109/EuroSP.2018.00032
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Rapid advances in quantum computing, together with the announcement by the National Institute of Standards and Technology (NIST) to define new standards for digital-signature, encryption, and key-establishment protocols, have created significant interest in post-quantum cryptographic schemes. This paper introduces Kyber (part of CRYSTALS - Cryptographic Suite for Algebraic Lattices - a package submitted to NIST post-quantum standardization effort in November 2017), a portfolio of post-quantum cryptographic primitives built around a key-encapsulation mechanism (KEM), based on hardness assumptions over module lattices. Our KEM is most naturally seen as a successor to the NEWHOPE KEM (Usenix 2016). In particular, the key and ciphertext sizes of our new construction are about half the size, the KEM offers CCA instead of only passive security, the security is based on a more general (and flexible) lattice problem, and our optimized implementation results in essentially the same running time as the aforementioned scheme. We first introduce a CPA-secure public-key encryption scheme, apply a variant of the Fujisaki-Okamoto transform to create a CCA-secure KEM, and eventually construct, in a black-box manner, CCA-secure encryption, key exchange, and authenticated-key-exchange schemes. The security of our primitives is based on the hardness of Module-LWE in the classical and quantum random oracle models, and our concrete parameters conservatively target more than 128 bits of postquantum security.
引用
收藏
页码:353 / 367
页数:15
相关论文
共 74 条
[1]  
Ajtai M., 1997, P 29 ANN ACM S THEOR, P284, DOI DOI 10.1145/258533.258604
[2]   A Subfield Lattice Attack on Overstretched NTRU Assumptions Cryptanalysis of Some FHE and Graded Encoding Schemes [J].
Albrecht, Martin ;
Bai, Shi ;
Ducas, Leo .
ADVANCES IN CRYPTOLOGY - CRYPTO 2016, PT I, 2016, 9814 :153-178
[3]   More on average case vs approximation complexity [J].
Alekhnovich, M .
44TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2003, :298-307
[4]  
Alkim E., 2016, IACR CRYPTOLOGY EPRI, V2016, P1157
[5]  
Alkim E, 2016, PROCEEDINGS OF THE 25TH USENIX SECURITY SYMPOSIUM, P327
[6]  
[Anonymous], 20161126 IACR CRYPT
[7]  
[Anonymous], ebacs: Ecrypt benchmarking of cryptographic systems
[8]  
[Anonymous], 2015, Search problems in cryptography
[9]  
Applebaum B, 2009, LECT NOTES COMPUT SC, V5677, P595, DOI 10.1007/978-3-642-03356-8_35
[10]  
Aumasson Jean-Philippe, 2016, BLAKE2X