Synthesis of Flexible Accelerators for Early Adoption of Ring-LWE Post-quantum Cryptography

被引:9
|
作者
Nejatollahi, Hamid [1 ]
Valencia, Felipe [2 ]
Banik, Subhadeep [3 ]
Regazzoni, Francesco [2 ]
Cammarota, Rosario [4 ]
Dutt, Nikil [1 ]
机构
[1] Univ Calif Irvine, Irvine, CA 92697 USA
[2] ALaRI, Lugano, Switzerland
[3] Ecole Polytech Fed Lausanne, Lausanne, Switzerland
[4] Intel AI Res, San Diego, CA USA
基金
欧盟地平线“2020”; 瑞士国家科学基金会;
关键词
Public key cryptography; post-quantum cryptography lattice-based cryptography; ideal lattices; domain specific acceleration; cache architecture;
D O I
10.1145/3378164
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The advent of the quantum computer makes current public-key infrastructure insecure. Cryptography community is addressing this problem by designing, efficiently implementing, and evaluating novel public-key algorithms capable of withstanding quantum computational power. Governmental agencies, such as NIST, are promoting standardization of quantum-resistant algorithms that is expected to run for 7 years. Several modern applications must maintain permanent data secrecy; therefore, they ultimately require the use of quantum-resistant algorithms. Because algorithms are still under scrutiny for eventual standardization, the deployment of the hardware implementation of quantum-resistant algorithms is still in early stages. In this article, we propose a methodology to design programmable hardware accelerators for lattice-based algorithms, and we use the proposed methodology to implement flexible and energy efficient post-quantum cache-based accelerators for NewHope, Kyber, Dilithium, Key Consensus from Lattice (KCL), and R.EMBLEM submissions to the NIST standardization contest. To the best of our knowledge, we propose the first efficient domain-specific, programmable cache-based accelerators for lattice-based algorithms. We design a single accelerator for a common kernel among various schemes with different kernel sizes, i.e., loop count, and data types. This is in contrast to the traditional approach of designing one special purpose accelerators for each scheme. We validate our methodology by integrating our accelerators into an HLS-based SoC infrastructure based on the X86 processor and evaluate overall performance. Our experiments demonstrate the suitability of the approach and allow us to collect insightful information about the performance bottlenecks and the energy efficiency of the explored algorithms. Our results provide guidelines for hardware designers, highlighting the optimization points to address for achieving the highest energy minimization and performance increase. At the same time, our proposed design allows us to specify and execute new variants of lattice-based schemes with superior energy efficiency compared to the main application processor without changing the hardware acceleration platform. For example, we manage to reduce the energy consumption up to 2.1x and energy-delay product (EDP) up to 5.2x and improve the speedup up to 2.5x.
引用
收藏
页数:17
相关论文
共 50 条
  • [1] Efficient Hardware Arithmetic for Inverted Binary Ring-LWE Based Post-Quantum Cryptography
    Imana, Jose L.
    He, Pengzhou
    Bao, Tianyou
    Tu, Yazheng
    Xie, Jiafeng
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2022, 69 (08) : 3297 - 3307
  • [2] Systolic Acceleration of Polynomial Multiplication for KEM Saber and Binary Ring-LWE Post-Quantum Cryptography
    Bao, Tianyou
    He, Pengzhou
    Xie, Jiafeng
    2022 IEEE INTERNATIONAL SYMPOSIUM ON HARDWARE ORIENTED SECURITY AND TRUST (HOST), 2022, : 157 - 160
  • [3] A Toolkit for Ring-LWE Cryptography
    Lyubashevsky, Vadim
    Peikert, Chris
    Regev, Oded
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2013, 2013, 7881 : 35 - 54
  • [4] FPGA Implementation of Compact Hardware Accelerators for Ring-Binary-LWE-based Post-quantum Cryptography
    He, Pengzhou
    Bao, Tianyou
    Xie, Jiafeng
    Amin, Moeness
    ACM TRANSACTIONS ON RECONFIGURABLE TECHNOLOGY AND SYSTEMS, 2023, 16 (03)
  • [5] Efficient Hardware Implementation of Finite Field Arithmetic AB plus C for Binary Ring-LWE Based Post-Quantum Cryptography
    Xie, Jiafeng
    He, Pengzhou
    Wang, Xiaofang Maggie
    Imana, Jose L.
    IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTING, 2022, 10 (02) : 1222 - 1228
  • [6] Ring-LWE Cryptography for the Number Theorist
    Elias, Yara
    Lauter, Kristin E.
    Ozman, Ekin
    Stange, Katherine E.
    DIRECTIONS IN NUMBER THEORY, 2016, 3 : 271 - 290
  • [7] Novel Low-Complexity Polynomial Multiplication Over Hybrid Fields for Efficient Implementation of Binary Ring-LWE Post-Quantum Cryptography
    He, Pengzhou
    Guin, Ujjwal
    Xie, Jiafeng
    IEEE JOURNAL ON EMERGING AND SELECTED TOPICS IN CIRCUITS AND SYSTEMS, 2021, 11 (02) : 383 - 394
  • [8] Efficient Implementation of Finite Field Arithmetic for Binary Ring-LWE Post-Quantum Cryptography Through a Novel Lookup-Table-Like Method
    Xie, Jiafeng
    He, Pengzhou
    Wen, Wujie
    2021 58TH ACM/IEEE DESIGN AUTOMATION CONFERENCE (DAC), 2021, : 1279 - 1284
  • [9] AKAME: A post-quantum authenticated key-agreement and message encryption scheme based on ring-LWE
    Choudhary S.
    Gupta A.
    International Journal of Information Technology, 2022, 14 (3) : 1669 - 1676
  • [10] Masked Accelerators and Instruction Set Extensions for Post-Quantum Cryptography
    Fritzmann T.
    Van Beirendonck M.
    Roy D.B.
    Karl P.
    Schamberger T.
    Verbauwhede I.
    Sigl G.
    IACR Transactions on Cryptographic Hardware and Embedded Systems, 2021, 2022 (01): : 414 - 460