A new algorithm for computing primitive elements in the field of Gaussian complex integers modulo a Mersenne prime

A new method is developed to find primitive elements in the Galois field of q
²
elements GF(q
²
), where q is a Mersenne prime. Such primitive elements are needed to implement transforms over GF(q
²
).