Fast, prime factor, discrete Fourier transform algorithms over GF(2m) for 8≤m≤10

In this paper it is shown that Winograd's algorithm for computing convolutions and a fast, prime factor, discrete Fourier transform (DFT) algorithm can be modified to compute Fourier-like transforms of long sequences of 2^m-1 points over GF(2^m), for 8=