Among the basic arithmetic operations over finite fields, the computation of multiplicative inverse is the most time consuming operation.
An implementation for computing multiplicative inverses in Galois fields GF(2 m) is presented.