International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: CFNTT: Scalable Radix-2/4 NTT Multiplication Architecture with an Efficient Conflict-free Memory Mapping Scheme

Authors:
Xiangren Chen , School of Integrated Circuits, Tsinghua University, Beijing, 100084, China
Bohan Yang , School of Integrated Circuits, Tsinghua University, Beijing, 100084, China
Shouyi Yin , School of Integrated Circuits, Tsinghua University, Beijing, 100084, China
Shaojun Wei , School of Integrated Circuits, Tsinghua University, Beijing, 100084, China
Leibo Liu , School of Integrated Circuits, Tsinghua University, Beijing, 100084, China
Download:
DOI: 10.46586/tches.v2022.i1.94-126
URL: https://tches.iacr.org/index.php/TCHES/article/view/9291
Search ePrint
Search Google
Abstract: Number theoretic transform (NTT) is widely utilized to speed up polynomial multiplication, which is the critical computation bottleneck in a lot of cryptographic algorithms like lattice-based post-quantum cryptography (PQC) and homomorphic encryption (HE). One of the tendency for NTT hardware architecture is to support diverse security parameters and meet resource constraints on different computing platforms. Thus flexibility and Area-Time Product (ATP) become two crucial metrics in NTT hardware design. The flexibility of NTT in terms of different vector sizes and moduli can be obtained directly. Whereas the varying strides in memory access of in-place NTT render the design for different radix and number of parallel butterfly units a tough problem. This paper proposes an efficient conflict-free memory mapping scheme that supports the configuration for both multiple parallel butterfly units and arbitrary radix of NTT. Compared to other approaches, this scheme owns broader applicability and facilitates the parallelization of non-radix-2 NTT hardware design. Based on this scheme, we propose a scalable radix-2 and radix-4 NTT multiplication architecture by algorithm-hardware co-design. A dedicated schedule method is leveraged to reduce the number of modular additions/subtractions and modular multiplications in radix-4 butterfly unit by 20% and 33%, respectively. To avoid the bit-reversed cost and save memory footprint in arbitrary radix NTT/INTT, we put forward a general method by rearranging the loop structure and reusing the twiddle factors. The hardware-level optimization is achieved by excavating the symmetric operators in radix-4 butterfly unit, which saves almost 50% hardware resources compared to a straightforward implementation. Through experimental results and theoretical analysis, we point out that the radix-4 NTT with the same number of parallel butterfly units outperforms the radix-2 NTT in terms of area-time performance in the interleaved memory system. This advantage is enlarged when increasing the number of parallel butterfly units. For example, when processing 1024 14-bit points NTT with 8 parallel butterfly units, the ATP of LUT/FF/DSP/BRAM n radix-4 NTT core is approximately 2.2 × /1.2 × /1.1 × /1.9 × less than that of the radix-2 NTT core on a similar FPGA platform.
BibTeX
@article{tches-2021-31644,
  title={CFNTT: Scalable Radix-2/4 NTT Multiplication Architecture with an Efficient Conflict-free Memory Mapping Scheme},
  journal={IACR Transactions on Cryptographic Hardware and Embedded Systems},
  publisher={Ruhr-Universität Bochum},
  volume={2022, Issue 1},
  pages={94-126},
  url={https://tches.iacr.org/index.php/TCHES/article/view/9291},
  doi={10.46586/tches.v2022.i1.94-126},
  author={Xiangren Chen and Bohan Yang and Shouyi Yin and Shaojun Wei and Leibo Liu},
  year=2021
}