Near optimal bounds for collision in Pollard Rho for discrete log

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2007, Pages 215-223

  Kim, Jeong Han ^a   Montenegro, Ravi ^b   Tetali, Prasad ^c  

^a Yonsei University   (South Korea)

^b University of Massachusetts Lowell   (United States)

^c Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CYCLIC GROUPS; DISCRETE LOGARITHMS; HIGH PROBABILITY; OPTIMAL BOUNDS; UPPER BOUNDS;

ALGEBRA; COMPUTER SCIENCE; FIBER OPTIC CHEMICAL SENSORS; FOUNDATIONS; STANDARDS;

HARVESTING;

EID: 46749100995     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2007.4389494     Document Type: Conference Paper

References (20)

1. D. Aldous and P. Diaconis, "Shuffling cards and stopping times," American Mathematical Monthly, Vol.93, 1986, pp. 333-348.
2. F. Chung, P. Diaconis and R. Graham, "Random walks arising in random number generation," The Annals of Probability, Vol. 15, 1987, pp. 1148-1165.
3. R. Crandall and C. Pomerance, "Prime Numbers : a computational perspective," Springer Verlag, 2nd ed., 2005, XVI.
4. J. Fill, "Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process," The Annals of Applied Probability, Vol. 1, 1991, pp. 62-87.
5. M. Hildebrand, "On the Chung-Diaconis-Graham random process," Electronic Communications in Probability, Vol. 11, 2006, pp. 347-356.
6. J. Horwitz and R. Venkatesan, "Random Cayley Digraphs and the Discrete Logarithm", Proc. of the 5th Algorithmic Number Theory Symposium (ANTS V); Springer LNCS Vol. 2369, 2002, pp. 416-430.
7. R. Lyons and Y. Peres and O. Schramm, "Markov chain intersections and the loop-erased walk," Ann. Inst. H. Poincaré Probab. Statist., Vol. 39, no. 5, 2003, pp. 779-791.
8. M. Mihail, "Conductance and Convergence of Markov Chains-A Combinatorial Treatment of Expanders," Proc. of the 30th Annual Symposium on Foundations of Computer Science, 1989, pp. 526-531.
9. S. Miller and R. Venkatesan, "Spectral Analysis of Pollard Rho Collisions," Proc. of the 7th Algorithmic Number Theory Symposium (ANTS VII);
10. Springer LNCS Vol. 4076, 2006, pp. 573-581.
11. S. Pohlig and M. Hellman, "An improved algorithm for computing logarithms over GF(p) and its cryptographic significance," IEEE Trans. Information Theory, Vol. 24, 1978, pp. 106-110.
12. J.M. Pollard, "A Monte Carlo method for factorization," BIT Nord. Tid. f. Inf. Vol. 15, 1975, pp. 331-334.
13. J.M. Pollard, "Monte Carlo methods for index computation (mod p)," Mathematics of Computation 32 (143) 1978, pp. 918-924.
14. C. Pomerance, "Elementary thoughts on discrete logarithms," to appear in the proceedings of an MSRI workshop, J. Buhler and P. Stevenhagen, eds. (Preprint available at http://www.math.dartmouth.edu/carlp)
15. V. Shoup, "Lower bounds for discrete logarithms and related problems," Proc. Advances in Cryptology - EUROCRYPT '97, 1997; Springer LNCS Vol. 1233, pp. 256-266.
16. A. Sinclair, "Improved bounds for mixing rates of Markov chains and multicommodity flow," Combinatorics, Probability and Computing, vol. 1, no. 4, 1992, pp. 351-370.
17. E. Teske, "Speeding up Pollard's rho method for computing discrete logarithms," Proc. of the 3rd Algorithmic Number Theory Symposium (ANTS III);
18. Springer LNCS Vol. 1423, pp. 541-554.
19. E. Teske, "On Random walks from Pollard's Rho Method," Math. Comp. Vol. 70, 2000, pp. 809-825.
20. E. Teske, "Square-root algorithms for the discrete logarithm problem (a survey)," In Public Key Cryptography and Computational Number Theory, Walter de Gruyter, 2001, pp. 283-301.