Abstract
Recently, Fenn et al. developed a fast finite field inversion algorithm in GF(2m) over the normal basis representation which uses about half the time complexity of traditional approaches. Further extensive improvement to this algorithm is presented here.

This publication has 6 references indexed in Scilit: