Lehmer-based algorithm for computing inverses in Galois fields GF(2 m )
Francisco Argüello · Electronics Letters · 2006
An algorithm for computing multiplicative inverses in Galois fields GF(2m) is presented. It is based on Lehmer's algorithm for computing the greatest common divisor of two integers. The algorithm is designed to be advantageous for Galois fields of large size.