Title :
Fast algorithms for computing the powers of a primitive element in GF(q2)
Author_Institution :
Japan Defence Agency, Tokyo, Japan
fDate :
8/1/1978 12:00:00 AM
Abstract :
In this correspondence a new algorithm for computing efficiently multiplications by powers of a primitive element in the finite field GF(q2), where q is a Mersenne prime, is described. This algorithm is applicable to transforms over GF(q2) which is used to implement fast circular convolutions without roundoff error.
Keywords :
Discrete Fourier transforms; Discrete transforms; Fast Fourier transforms; Fourier transforms; Galois fields; Research and development; Roundoff errors;
Journal_Title :
Acoustics, Speech and Signal Processing, IEEE Transactions on
DOI :
10.1109/TASSP.1978.1163098
