The construction of self-dual normal polynomials over GF(2) and their applications to the Massey-Omura algorithm
A. David Rae, M K Pathan · Brunel University Research Archive (BURA) (Brunel University London) · 1990
Gaussian periods are used to locate a normal element of the finite field GF(2e) of odd degree e and an algorithm is presented for the construction of self-dual normal polynomials over GF(2) for any odd degree. This gives a new constructive proof of the existence of a self-dual basis for odd degree. The use of such polynomials in the Massey-Omura multiplier improves the efficiency and decreases the complexity of the multiplier