Discrete logarithm of the cyclic group

This is the discrete logarithm problem where the group is a cyclic group.

In this case, the problem becomes equivalent to reversing modular exponentiation.

This computational problem forms the basis for Diffie-Hellman key exchange, because modular exponentiation can be efficiently computed, but no known way exists to efficiently compute the reverse function.