A NEW ALGORITHM FOR COMPUTING INVERSES IN THE FINITE FIELD GF(2m)
有限域GF (2m)上的一个新的求逆算法

A new algorithm with the complexity O(logm) is presented to compute inverses in the finite field GF(2m) based on the normal basis representations and the Massey-Omura s multipliers. The inverse in GF(2m) can be computed with log2(m-1)]+w(m-1)-1 multiplications and m-1 cyclic shifts, where x] denotes the maximum integer less than or equal to x, w(m-1) the number of "1" in the binary representation of m-1.