On random walks for Pollard's rho method

Mathematics of Computation

Volumn 70, Issue 234, 2001, Pages 809-825

  Teske, Edlyne ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Discrete logarithm; Pollard's rho method; Random walks in groups

Indexed keywords

EID: 0035531397     PISSN: 00255718     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0025-5718-00-01213-8     Document Type: Article

References (23)

1. J. Arney and E. A. Bender, Random mappings with constraints on coalescence and number of origins, Pacific Journal of Mathematics 103 (1982), 269-294. MR 84h:05110
2. S.R. Blackburn and S. Murphy, The number of partitions in Pollard rho, Private communication, May 1998.
3. R.P. Brent and J.M. Pollard, Factorization of the eighth Fermat number, Mathematics of Computation 36 (1981), 627-630. MR 83h:10014
4. J. J. Dai and M. V. Hildebrand, Random random walks on the integers mod n, Statistics and Probability Letters 35 (1997), 371-379. MR 99f:60128
5. R. Gallant, R. Lambert, and S. Vanstone, Improving the parallelized Pollard lambda search on binary anomalous curves, to appear in Mathematics of Computation.
6. B. Harris, Probability distributions related to random mappings, Annals of Math. Statistics 31 (1960), 1045-1062. MR 22:9993
7. M. V. Hildebrand, Random walks supported on the random points of ℤ/nℤ, Probability Theory and Related Fields 100 (1994), 191-203. MR 95j:60015
8. J. Horwitz and R. Venkatesan, Random Cayley graphs and the discrete log, Preprint, 1998.
9. D. B. Kececioglu, Reliability and life testing handbook, vol. 1, Prentice Hall, Englewood Cliffs, New Jersey, 1993.
10. D. E. Knuth, The art of computer programming. volume 3: Sorting and searching, Addison-Wesley, Reading, Massachusetts, 1973. MR 56:4281
11. LiDIA Group, Technische Universität Darmstadt, LiDIA - a library for computational number theory, version 1.3, 1997, Available from http://www.informatik.tu-darmstadt.de/TI/LiDIA.
12. A. Menezes, P. van Oorschot, and S. A. Vanstone, Handbook of applied cryptography, CRC Press, 1996. MR 99g:94015
13. 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 (1978), 106-110. MR 58:4617
14. J. M. Pollard, Private communications, March 1998, March 1999.
15. J. M. Pollard, A Monte Carlo method for factorization, BIT 15 (1975), no. 3, 331-335. MR 52:13611
16. J. M. Pollard, Monte Carlo methods for index computation (mod p), Mathematics of Computation 32 (1978), no. 143, 918-924. MR 58:10684
17. C. P. Schnorr and H. W. Lenstra, Jr., A Monte Carlo factoring algorithm with linear storage, Mathematics of Computation 43 (1984), no. 167, 289-311. MR 85d:11106
18. R. Sedgewick, T. G. Szymanski, and A. C. Yao, The complexity of finding cycles in periodic functions, SIAM J. Computing 11 (1982), no. 2, 376-390. MR 83f:68045
19. E. Teske, New algorithms for finite abelian groups, Ph.D. thesis, Technische Universität Darmstadt, Germany, 1998, Shaker Verlag, Aachen.
20. E. Teske, A space efficient algorithm for group structure computation, Mathematics of Computation 67 (1998), 1637-1663. MR 99a:11146
21. E. Teske, Speeding up Pollard's rho method for computing discrete logarithms, Algorithmic Number Theory Seminar ANTS-III, Lecture Notes in Computer Science, vol. 1423, Springer-Verlag, 1998, pp. 541-554.
22. P. C. van Oorschot and M. J. Wiener, Parallel collision search with cryptanalytic applications, Journal of Cryptology 12 (1999), 1-28. MR 99i:49054
23. M. Wiener and R. Zuccerato, Faster attacks on elliptic curve cryptosystems, Proceedings of SAC, Workshop on Selected Areas in Cryptography, Lecture Notes in Computer Science, 1998.