An efficient hardware accelerator for NTT-based polynomial multiplication using FPGA

The number theoretic transform (NTT) is used to efficiently execute polynomial multiplication. It has become an important part of lattice-based post-quantum methods and the subsequent generation of standard cryptographic systems. However, implementing post-quantum schemes is challenging since they rely on intricate structures. This paper demonstrates how to develop a high-speed NTT multiplier highly optimized for FPGAs with few logical resources. We describe a novel architecture for NTT that leverages unique precomputation. Our method efficiently maps these specific pre-computed values into the built-in Block RAMs, which greatly reduces the area and time required for implementation when compared to previous works. We have chosen Kyber parameters to implement the proposed architectures. Compared to the most well-known approach for implementing Kyber’s polynomial multiplication using NTT, the AC (area \(\times \) $\times$ latency) is reduced by \(33\%\) $33\%$ , and AT (area \(\times \) $\times$ time) is improved by \(18\%\) $18\%$ as a result of the pre-computation we suggest in this study.