@inproceedings{38786e3d598541c2a68bbd6fefa4ee4e,
title = "On the efficiency of Pollard's rho method for discrete logarithms",
abstract = "Pollard's rho method is a randomized algorithm for computing discrete logarithms. It works by defining a pseudo-random sequence and then detecting a match in the sequence. Many improvements have been proposed, while few evaluation results and efficiency suggestions have been reported. This paper is devoted to a detailed study of the efficiency issues in Pollard's rho method. We describe an empirical performance analysis of several widely applied algorithms. This should provide a better combination of algorithms and a good choice of parameters for Pollard's rho method.",
keywords = "Discrete logarithm, Elliptic curve discrete logarithm, Pollard's rho method",
author = "Shi Bai and Brent, {Richard P.}",
year = "2008",
language = "English",
isbn = "9781920682583",
series = "Conferences in Research and Practice in Information Technology Series",
booktitle = "Theory of Computing 2008 - Proceedings of the Fourteenth Computing",
note = "Theory of Computing 2008 - 14th Computing: The Australasian Theory Symposium, CATS 2008 ; Conference date: 22-01-2008 Through 25-01-2008",
}