Fast algorithms for computing the powers of a primitive element in GF(q2)

In this correspondence a new algorithm for computing efficiently multiplications by powers of a primitive element in the finite field GF(q
²
), where q is a Mersenne prime, is described. This algorithm is applicable to transforms over GF(q
²
) which is used to implement fast circular convolutions without roundoff error.