Algorithm 3 Itoh-Tsujii Inversion for Generic Binary Fields Where Extra Storage is Used.

Input:$A\left(x\right)\in {\mathbb{F}}_{2^m}$, $U=u_0,u_1,\dots u_{r-1}$ the binary representation of 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=0$ to $r-1$ do   $B\left(x\right)\leftarrow C\left(x\right)$   for $j=0$ to $2^i$ do    $B\left(x\right)\leftarrow B^2\left(x\right)\mathrm{mod}f\left(x\right)$   end for   $C\left(x\right)\leftarrow C\left(x\right)B\left(x\right)\mathrm{mod}f\left(x\right)$   $D_i\left(x\right)\leftarrow C\left(x\right)$  end for  for $i=r-2$ to 1 do   if $u_i=1$ then    $B\left(x\right)\leftarrow C\left(x\right)$    for $j=0$ to $2^i$ do     $B\left(x\right)\leftarrow B^2\left(x\right)\mathrm{mod}f\left(x\right)$    end for    $C\left(x\right)\leftarrow C\left(x\right)D_i\left(x\right)\mathrm{mod}f\left(x\right)$   end if  end for  $C\left(x\right)\leftarrow C^2\left(x\right)\mathrm{mod}f\left(x\right)$  return $C\left(x\right)$