Polar Codes for Module-LWE Public Key Encryption: The Case of Kyber

被引:1
作者
Papadopoulos, Iason [1 ]
Wang, Jiabo [2 ]
机构
[1] Imperial Coll London, Dept Elect & Elect Engn, London SW7 2AZ, England
[2] Nanyang Technol Univ, Strateg Ctr Res Privacy Preserving Technol & Syst, Singapore 639798, Singapore
关键词
Kyber; Polar Codes; public key encryption; module LWE; decryption failure rate; post-quantum security;
D O I
10.3390/cryptography7010002
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In modern society, the Internet is one of the most used means of communication. Thus, secure information transfer is inevitably of major importance. Computers nowadays use encryption methods based on arithmetic operations to turn messages into ciphertexts that are practically impossible for an attacker to reverse-engineer using a classical computer. Lately, it has been proven that this is possible in a post-quantum setting where quantum computers of considerable size are available to attackers. With the advance of technology of quantum computers, it is now more necessary than ever before to construct encryption schemes that cannot be broken either using a classical or a quantum computer. The National Institute of Technology and Standards (NIST) has orchestrated a competition, and numerous encryption schemes have been proposed. The NIST has identified one algorithm to be standardized for the post-quantum era. This algorithm is called CRYSTALS-Kyber and is based on module learning with errors (MLWE). This paper investigates how to apply error correcting codes in order to create some excess decryption failure rate (DFR) and to take advantage of that in order to re-tune Kyber's parameters in the pursuit of higher security. By applying Polar Codes, Kyber's security was managed to be increased by 54.4% under a new set of parameters, while keeping the decryption failure rate well below the upper acceptable bound set by the NIST.
引用
收藏
页数:11
相关论文
共 17 条
  • [1] Alkim E, 2016, PROCEEDINGS OF THE 25TH USENIX SECURITY SYMPOSIUM, P327
  • [2] [Anonymous], 2022, CSRCNISTGOV POSTQUAN
  • [3] Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
    Arikan, Erdal
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (07) : 3051 - 3073
  • [4] Avanzi R., 2022, ALGORITHM SPECIFICAT
  • [5] Design of Polar Codes in 5G New Radio
    Bioglio, Valerio
    Condo, Carlo
    Land, Ingmar
    [J]. IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2021, 23 (01): : 29 - 40
  • [6] Bisheh-Niasar M., 2021, INT C CRYPT INF SEC
  • [7] High-Speed NTT-based Polynomial Multiplication Accelerator for Post-Quantum Cryptography
    Bisheh-Niasar, Mojtaba
    Azarderakhsh, Reza
    Mozaffari-Kermani, Mehran
    [J]. 2021 IEEE 28TH SYMPOSIUM ON COMPUTER ARITHMETIC (ARITH 2021), 2021, : 94 - 101
  • [8] Bos J., 2018, P 2018 IEEE EUROPEAN
  • [9] DAnvers J.P., 2021, Cryptology ePrint Archive, Report 2021/1422
  • [10] Fritzmann T., 2018, SELECTED AREAS INCRY, P369