  A novel method for computation of the discrete Fourier transform over a
finite field with reduced multiplicative complexity is described. If the number
of multiplications is to be minimized, then the novel method for the finite
field of even extension degree is the best known method of the discrete Fourier
transform computation. A constructive method of constructing for a cyclic
convolution over a finite field is introduced.
