A Birthday Paradox for Markov chains, with an optimal bound for collision in the Pollard Rho algorithm for discrete logarithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5011 LNCS, Issue , 2008, Pages 402-415

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

^a Yonsei University   (South Korea)

^b UNIVERSITY OF MASSACHUSETTS LOWELL   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d Georgia Institute of Technology   (United States)

Author keywords

Birthday Paradox; Collision time; Discrete logarithm; Pollard Rho; Self intersection

Indexed keywords

BIRTHDAY PARADOX; COLLISION TIME; DISCRETE LOGARITHM; POLLARD RHO; SELF INTERSECTION;

ALGORITHMS; PROBABILITY DISTRIBUTIONS;

MARKOV PROCESSES;

EID: 44649172610     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-79456-1_27     Document Type: Conference Paper

References (15)

1. Aldous, D., Fill, J.: Reversible Markov Chains and Random walks on Graphs (in preparation), http://www.stat.berkeley.edu/∼aldous
2. Crandall, R., Pomerance, C.: Prime Numbers: a Computational Perspective, 2nd edn. Springer, Heidelberg (2005)
3. Fill, J.: Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process. The Annals of Applied Probability 1, 62-87 (1991)
4. Le Gall, J.F., Rosen, J.: The range of stable random walks. Ann. Probab. 19, 650-705 (1991)
5. Kim, J.-H., Montenegro, R., Tetali, P.: Near optimal bounds for collision in Pollard Rho for discrete log. In: Proc. 48th Annual Symposium on Foundations of Computer Science (FOCS 2007) (2007)
6. Lyons, R., Peres, Y., Schramm, O.: Markov chain intersections and the loop-erased walk. Ann. Inst. H. Poincaré Probab. Statist. 39(5), 779-791 (2003)
7. Miller, S., Venkatesan, R.: Spectral analysis of Pollard Rho collisions. In: Hess, F., Pauli, S., Pohst, M. (eds.) ANTS 2006. LNCS, vol. 4076, pp. 573-581. Springer, Heidelberg (2006)
8. Miller, S., Venkatesan, R.: Personal communications (2007)
9. Pohlig, S., Hellman, M.: An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Trans. Information Theory 24, 106-110 (1978)
10. Pollard, J.M.: A Monte Carlo method for factorization. BIT Nord. Tid. f. Inf. 15, 331-334 (1975)
11. Pollard, J.M.: Monte Carlo methods for index computation (mod p). Math. Comp. 32(143), 918-924 (1978)
12. Pomerance, C.: Elementary thoughts on discrete logarithms. In: Buhler, J.P., Stevenhagen, P. (eds.) Algorithmic Number Theory: Lattices, Number Fields, Curves and Cryptography, vol. 44, Mathematical Sciences Research Institute Publications (to appear, 2007), http://www.math.dartmouth.edu/∼carlp
13. Shoup, V.: Lower bounds for discrete logarithms and related problems. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 256-266. Springer, Heidelberg (1997)
14. Sinclair, A.: Improved bounds for mixing rates of Markov chains and multicom-modity flow. Combinatorics, Probability and Computing 1(4), 351-370 (1992)
15. Teske, E.: Square-root algorithms for the discrete logarithm problem (a survey). In: Public Key Cryptography and Computational Number Theory, pp. 283-301. Walter de Gruyter (2001)