They also separately give algorithm for Fourier transform over complex number faster than O(n log n)
replyWikipedia just told me there's a galactic algorithm for integer multiplication in O(n log n) based on FFT so I'm guessing those two proofs are related.
replyMultiplication is a lot like convolution, so the connection is natural.
reply