Algorithm 1 Wang Inversion Method.

Input:$A\left(x\right)\in {\mathbb{F}}_{2^m}$, $f\left(x\right)$ the irreducible polynomial of ${\mathbb{F}}_{2^m}$ Output: $C\left(x\right)=A^{-1}\left(x\right)\mathrm{mod}f\left(x\right)$  $C\left(x\right)\leftarrow A\left(x\right)$  for $i=1$ to $m-2$ do   $B\left(x\right)\leftarrow C^2\left(x\right)\mathrm{mod}f\left(x\right)$   $C\left(x\right)\leftarrow A\left(x\right)B\left(x\right)\mathrm{mod}f\left(x\right)$  end for  $C\left(x\right)\leftarrow C^2\left(x\right)\mathrm{mod}f\left(x\right)$  return $C\left(x\right)$