We will develop the discrete Fourier transform from an algebraic point of view and then introduce the fast Fourier transform to speed up the computation of the discrete Fourier transform. We then show how the fast Fourier transform can be used to quickly multiply high degree polynomials and large integers.
(A knowledge of basic group theory would be helpful.)