On the solvability of the discrete logarithm problem in residue classes

O. N. Vasilenko

M. V. Lomonosov Moscow State University

Abstract: The article is devoted to solvability of the discrete logarithm problem modulo composite number. Two theorems are proved, giving necessary and sufficient conditions for solvability in some cases. Also one method is suggested for proving solvability, analogous to the Pohlig–Hellman algorithm for solving the discrete logarithm problem.

UDC: 511.9

Received: 01.04.1998

Bibliographic databases:

• 
•