Fast algorithms for complex integer transforms

In this correspondence both high-radix and real-valued input FFT algorithms are applied to transforms over the finite field GF(q
²
), where q is a Mersenne prime. Such transforms can be used to implement fast circular convolutions without roundoff error. Of particular interest is a new radix 8 FFT algorithm, which requires fewer multiplications than the conventional radix 8 FFT algorithm.