Effective recursive algorithm for computing multiplicative inverses in GF (2 m )
Toshiya Itoh, Shigeo Tsujii · Electronics Letters · 1988
The letter presents an effective recursive algorithm for computing multiplicative inverses in GF(2m), where m = 2k, employing normal bases. The proposed algorithm requires m − 1 cyclic shifts and two multiplications in GF(2m) and in each subfield of GF(2m): GF(2m/2), GF(2m/4), …, GF(28) and GF(24).