Reconfigurable Polynomial Multiplication Architecture for Lattice-based Post-quantum Cryptography Algorithms

被引：0
|
作者：
Chen T. [1 ]
Li H. [1 ]
Li W. [1 ]
Nan L. [1 ]
Du Y. [1 ]
机构：
[1] LA Information Engineering University, Zhengzhou
来源：
Dianzi Yu Xinxi Xuebao/Journal of Electronics and Information Technology | 2023年 / 45卷 / 09期
基金：
中国国家自然科学基金;
关键词：
Lattice-based post-quantum cryptography; Polynomial multiplication; Preprocesthen-Number Theoretic Transformation (PtNTT); Reconfigurable;
D O I：
10.11999/JEIT230284
中图分类号：
学科分类号：
摘要：
Focusing on the current situation that polynomial multiplication parameters in lattice-based cryptography algorithms with different difficult problems and the implementation architecture are not uniform, a reconfigurable architecture based on Preprocess-then-Number Theoretic Transformation (PtNTT) algorithm is proposed. Firstly, the influence of polynomial parameters (number of items, modulus and modulus polynomial) on reconfigurable architecture is integrated by analyzing the characteristics of polynomial multiplication. Secondly, a 4×4 series of parallel convertible arithmetic unit architecture is designed for different terms and modular polynomials, which can meet the scalable design of different bit width k-based number theory transformations. Specifically, a reconfigurable unit that can realize 16-bit modular multiplication and 32-bit multiplication is designed for different modules. In the process of data demand analysis, a multi-bank storage structure satisfying the k-based number theory transformation is designed by constructing a distribution mechanism based on coefficient address generation, bank division and actual and virtual address correspondence logic. Experimental results show that this paper supports the implementation of polynomial multiplication in the four types of algorithms Kyber, Saber, Dilithium and NTRU.The polynomial multiplication operation in the four algorithms can be realized by using a unified architecture compared with the other reconfigurable architectures. A set of polynomial multiplication operations with 256 terms and a modulus of 3329 can be completed at 1.599 ms, consuming 243 clocks on Xilinx Artix-7 FPGA platform. © 2023 Science Press. All rights reserved.
引用
收藏
页码：3380 / 3392
页数：12
相关论文
共 15 条
  • [1] SHOR P W., Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer[J], SIAM Review, 41, 2, pp. 303-332, (1999)
  • [2] ALAGIC G, ALPERIN-SHERIFF J, APON D, Et al., Status report on the second round of the NIST post-quantum cryptography standardization process, (2020)
  • [3] ALAGIC G, ALPERIN-SHERIFF J, APON D, Et al., Status report on the first round of the NIST post-quantum cryptography standardization process
  • [4] (2019)
  • [5] BANERJEE U, UKYAB T S, CHANDRAKASAN A P., Sapphire: A configurable crypto-processor for post-quantum lattice-based protocols[J], IACR Transactions on Cryptographic Hardware and Embedded Systems, 2019, 4, pp. 17-61, (2019)
  • [6] FRITZMANN T, SHARIF U, MULLER-GRITSCHNEDER D, Et al., Towards reliable and secure post-quantum coprocessors based on RISC-V[C], 2019 Design, Automation & Test in Europe Conference & Exhibition (DATE), pp. 1148-1153, (2019)
  • [7] LIU Dongsheng, ZHAO Wending, LIU Zilong, Et al., Reconfigurable hardware design of multi-lanes number theoretic transform for lattice-based cryptography[J], Journal of Electronics & Information Technology, 44, 2, pp. 566-572, (2022)
  • [8] FRITZMANN T, SIGL G, SEPULVEDA J., RISQ-V: Tightly coupled RISC-V accelerators for post-quantum cryptography, (2020)
  • [9] LI Aobo, LIU Dongsheng, LI Xiang, Et al., A flexible instruction-based post-quantum cryptographic processor with modulus reconfigurable arithmetic unit for module LWR&E[C], 2022 IEEE Asian Solid-State Circuits Conference (A-SSCC), pp. 1-3, (2022)
  • [10] ZHAO Yifan, XIE Ruiqi, XIN Guozhu, Et al., A high-performance domain-specific processor with matrix extension of RISC-V for module-LWE Applications[J], IEEE Transactions on Circuits and Systems I:Regular Papers, 69, 7, pp. 2871-2884, (2022)
12