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

@inproceedings{Kuhn2001RandomWR,
  title={Random Walks Revisited: Extensions of Pollard's Rho Algorithm for Computing Multiple Discrete Logarithms},
  author={Fabian Kuhn and Ren{\'e} Struik},
  booktitle={Selected Areas in Cryptography},
  year={2001}
}
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. 
Highly Cited
This paper has 43 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 27 extracted citations

Similar Papers

Loading similar papers…