A-16 Efficient Polynomial Multiplication by FFT and NTT

- Reference: Polynomials and the Fast Fourier Transform (FFT) [5]


A-16.1 Background and Motivation
A-16.2 Forward FFT (or NTT)
A-16.2.1 High-level Idea
A-16.2.2 Details
A-16.3 Point-wise Multiplication
A-16.4 Inverse FFT (or NTT)