Random Walks Revisited: Extensions of Pollard's Rho Algorithm for Computing Multiple Discrete Logarithms

This paper extends the analysis of Pollard’s rho algorithm for solving a single instance of the discrete logarithm problem in a finite cyclic group G to the case of solving more than one instance of the discrete logarithm problem in the same group G. We analyze Pollard’s rho algorithm when used to iteratively solve all the instances. We also analyze the situation when the goal is to solve any one of the multiple instances using any DLP algorithm.

• Type: Conference
• Year: 2001
• Where: SACRYPT
• Authors: Fabian Kuhn, René Struik
• Keywords: Cryptology, Discrete Logarithm Problem, Pollard’s Rho Algorithm, SACRYPT 2001, finite Cyclic Group