GitHub

Multiplying-two-polynomials-using-FFT

For Naive Approach we'll just multiply each term of first polynomial with each term of second polynomial. This will take O(N^2) Time. For FFT approach Using Fast Fourier Transform will Give Us Time ...
IEEE

PaReNTT: Low-Latency Parallel Residue Number System and NTT-Based Long Polynomial Modular Multiplication for Homomorphic Encryption

Abstract: High-speed long polynomial multiplication is important for applications in homomorphic encryption (HE) and lattice-based cryptosystems. This paper addresses low-latency hardware ...