Spectral analysis of Pollard Rho collisions

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

Volumn 4076 LNCS, Issue , 2006, Pages 573-581

  Miller, Stephen D ^a,b   Venkatesan, Ramarathnam ^c,d  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b RUTGERS UNIVERSITY   (United States)

^c MICROSOFT RESEARCH   (United States)

^d MICROSOFT RESEARCH INDIA   (India)

Author keywords

Collision time; Discrete logarithm; Expander graph; Mixing time; Pollard Rho algorithm; Random walk; Spectral analysis

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; NUMBER THEORY; PROBABILITY DISTRIBUTIONS; SPECTRUM ANALYSIS;

COLLISION TIME; DISCRETE LOGARITHM; EXPANDER GRAPH; MIXING TIME; POLLARD RHO ALGORITHM; RANDOM WALK;

GRAPH THEORY;

EID: 33746760415     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11792086_40     Document Type: Conference Paper

References (14)

1. Eric Bach, Toward a theory of Pollard's rho method, Inform, and Comput. 90 (1991), no. 2, 139-155.
2. Béla Bollobás, Modern graph theory, Graduate Texts in Mathematics, vol. 184, Springer-Verlag, New York, 1998.
3. J.A. Fill, Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process, Ann. Appl. Probab. 1 (1991), 62-87.
4. Martin Hildebrand, A survey of results on random walks on finite groups, Probab. Surv. 2 (2005), 33-63 (electronic).
5. Jeremy Horwitz, Applications of Cayley Graphs, Bilinearity, and Higher-Order Residues to Cryptology, Ph.D. Thesis, Stanford University, 2004. http://math.scu.edu/~jhorwitz/pubs/.
6. Jeremy Horwitz and Ramarathnam Venkatesan, Random Cayley digraphs and the discrete logarithm, Algorithmic number theory (Sydney, 2002), 2002, pp. 416-430.
7. László Lovâsz and Peter Winkler, Mixing times, Microsurveys in discrete probability (Princeton, NJ, 1997), 1998, pp. 85-133.
8. Stephen D. Miller, Ilya Mironov, and Ramarathnam Venkatesan, Fast and Secure Stream Cipher Designs Using Rapidly Mixing Random Walks and Revolving Buffers (2005). Preprint.
9. Ravi Montenegro and Prasad Tetali, Mathematical Aspects of Mixing Times in Markov Chains, Foundations and Trends in Theoretical Computer Science, 2006.
10. Hugh L. Montgomery, Ten lectures on the interface between analytic number theory and harmonic analysis, CBMS Regional Conference Series in Mathematics, vol. 84, Published for the Conference Board of. the Mathematical Sciences, Washington, DC, 1994.
11. Victor Shoup, Lower bounds for discrete logarithms and related problems, Advances in cryptology - EUROCRYPT '97 (Konstanz), 1997, pp. 256-266. Updated version at http://www.shoup.net/papers/dlbounds1.pdf.
12. J. Michael Steele, The Cauchy-Schwarz master class, MAA Problem Books Series, Mathematical Association of America, Washington, DC, 2004. An introduction to the art of mathematical inequalities.
13. Edlyn Teske, On random walks for Pollard's rho method, Math. Comp. 70 (2001), no. 234, 809-825.
14. _, Square-root algorithms for the discrete logarithm problem (a survey), Public-key cryptography and computational number theory (Warsaw, 2000), 2001, pp. 283-301.