Fast algorithm for computing a primitive 2 p +1 p th root of unity in GF [(2 p −1) 2 ]
I.S. Reed, T. K. Truong, Robert Miller · Electronics Letters · 1978
A Quick method is developed to find an element or order 2p+1p in the finite field GF(q2), where q = 2P−1 is a Mersenne prime. Such an element is needed to implement complex integer transforms of length 2kp over GF(q2 where 3 ≤ k ≤ p + 1.