Efficient method to find the multiplicative inverse in GF (2<sup>m</sup>) using FPGA by exponentiation to (2<sup>k</sup>)
(1)