Pollard's rho algorithm for logarithms

Pollard's rho algorithm for logarithms is an algorithm introduced by John Pollard in 1978 to solve the discrete logarithm problem, analogous to Pollard's rho algorithm to solve the integer factorization problem. The goal is to compute γ {\displaystyle \gamma } such that α γ = β {\displaystyle \alpha ^{\gamma }=\beta } , where β {\displaystyle \beta } belongs to a cyclic group G {\displaystyle G} generated by α {\displaystyle \alpha } .

Source: Wikipedia — Pollard's rho algorithm for logarithms (CC BY-SA 4.0)