Analysis on a generalized algorithm for the strong discrete logarithm problem with auxiliary inputs
Minkyu Kim, Jung Hee Cheon, In-Sok Lee · Mathematics of Computation · 2014
We investigate a recently proposed algorithm solving the strong discrete logarithm problem with auxiliary inputs, and show that this algorithm in general is not more efficient than ordinary discrete-logarithm-solving algorithms such as Pollard’s rho method, by analyzing a lower bound on the sum of digits of integers.