Formulas.

Let

be a commutative ring with 1. We recall the algorithm for computing the inverse of a polynomial $f \in R[x]$ modulo a power of

$\fbox{ \begin{minipage}{10 cm} \begin{description} \item[{\bf Input:}] $f \in R[... ... \mod{ \ x^{2^i}} $\ \\ \> {\bf return} $g_r$\ \\ \end{tabbing}\end{minipage}}$

Marc Moreno Maza
2008-01-31