Abstract:
In the present paper, a polynomial algorithm is suggested for
reducing the problem of taking the discrete logarithm in the ring
of algebraic integers modulo a power of a prime ideal to a
similar problem with the power equal to one.
Explicit formulas are
obtained; instead of the Fermat quotients, in the case of residues
in the ring of rational integers, these formulas use other
polynomially computable logarithmic functions, like the
$\mathfrak{p}$-adic logarithm.
Keywords:Polynomial algorithm, discrete logarithm, ring of algebraic integers, Fermat quotients, $\mathfrak{p}$-adic logarithm.