Constructing SCN bases in characteristic 2
Alain Poli · IEEE Transactions on Information Theory · 1995
A simple deterministic algorithm to construct a normal basis of GF(q/sup n/) over GF(q) (q=p/sup r/, p prime) is given. When p=2, the authors deduce a (self complementary normal-SCN) basis of GF(q/sup n/) over GF(q) for n odd, or n=2t, t odd. In characteristic 2 these cases are known to be the only possible ones for which there exists an SCN basis.>