Finding (good) normal bases in finite fields
T. Beth, Willi Geiselmann, Fredrik Meyer · 1991
An algorithm to generate low complexity normal bases in finite fields is presented.This algorithm generalizes the method of Ash et al. to fields of arbitrary characteristic.It can be applied to most finite fields and produces (under certain conditions) the multiplication matrix for the normal basis multiplication of GF'(qn) : GI'(q) in 0(n2 log2 n log q) bit-operations.