Long Polynomial Modular Multiplication Using Low-Complexity Number Theoretic Transform [Lecture Notes]
Sin-Wei Chiu, Keshab K. Parhi · IEEE Signal Processing Magazine · 2024
This tutorial aims to establish connections between polynomial modular multiplication over a ring to circular convolution and the discrete Fourier transform (DFT). The main goal is to extend the well-known theory of the DFT in signal processing (SP) to other applications involving polynomials in a ring, such as homomorphic encryption (HE).