Abstract
We formally show that there is an algorithm for dlog over all abelian groups that runs in expected optimal time (up to logarithmic factors) and uses only a small amount of space. To our knowledge, this is the first such analysis. Our algorithm is a modification of the classic Pollard rho, introducing explicit randomization of the parameters for the updating steps of the algorithm, and is analyzed using random walks with limited independence over abelian groups (a study which is of its own interest). Our analysis shows that finding cycles in such large graphs over groups that can be efficiently locally navigated is as hard as dlog.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
N. Alon and Y. Roichman, “Random Cayley Graphs and Expanders.” Random Structures and Algorithms, 5:271–284, 1994.
E. Bach, “Toward a Theory of Pollard’s Rho Method.” Information and Computation, 90(2):139–155, 1991.
M. Bellare and J. Rompel, “Randomness-Efficient Oblivious Sampling.” Symposium on Foundations of Computer Science (FOCS’ 94):276–287, 1994.
B. Bollobas, Modern Graph Theory, Graduate Texts in Mathematics 184. Springer-Verlag, Berlin, 1998.
A. Broder and E. Shamir, “On the Second Eigenvalue of Random Regular Graphs.” Symposium on the Foundations of Computer Science (FOCS’ 87):286–294, 1987.
P. Erdős and A. Rényi, “Probabilistic Methods in Group Theory.” Journal d’Analyse Mathématique, 14:127–138, 1965.
S.C. Pohlig and M.E. Hellman, “An Improved Algorithm for Computing Logarithms over GF(p) and Its Cryptographic Significance.” IEEE Transactions on Information Theory, 24:106–110, 1978.
J.M. Pollard, “Monte Carlo Methods for Index Computation (mod p).” Mathematics of Computation, 32(143):918–924, 1978.
Y. Roichman, “On Random Random Walks.” Annals of Probability, 24(2):1001–1011, 1996.
V. Shoup, “Lower Bounds for Discrete Logarithms and Related Problems.” Advances in Cryptology: EUROCRYPT’ 97 (LNCS 1233):256–266, 1997.
E. Teske, “Speeding Up Pollard’s Rho Method for Computing Discrete Logarithms.” Algorithmic Number Theory Symposium III: ANTS-III (LNCS 1423):551–554, 1998.
E. Teske, “On Random Walks for Pollard’s Rho Method.” Mathematics of Computation, 70:809–825, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Horwitz, J., Venkatesan, R. (2002). Random Cayley Digraphs and the Discrete Logarithm. In: Fieker, C., Kohel, D.R. (eds) Algorithmic Number Theory. ANTS 2002. Lecture Notes in Computer Science, vol 2369. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45455-1_33
Download citation
DOI: https://doi.org/10.1007/3-540-45455-1_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43863-2
Online ISBN: 978-3-540-45455-7
eBook Packages: Springer Book Archive