Rader's FFT Algorithm for Prime Lengths

Rader's FFT algorithm can be used to compute DFTs of length $N$ in ${\cal O}(N\lg N)$ operations when $N$ is a prime number. For an introduction, see

http://en.wikipedia.org/wiki/Rader's_FFT_algorithm