Kangaroos, monopoly and discrete logarithms

Journal of Cryptology

Volumn 13, Issue 4, 2000, Pages 437-447

  Pollard, J M ^a  

^a Tidmarsh Cottage   (United Kingdom)

Author keywords

Discrete logarithms; Kangaroo method

Indexed keywords

EID: 0005506834     PISSN: 09332790     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001450010010     Document Type: Article

References (12)

1. R. P. Brent, Parallel algorithms for integer factorisation, in J. H. Loxton (ed.), Number Theory and Cryptography, LMS Lecture Note Series 154, Cambridge University Press, Cambridge, 1990, pp. 26-37.
2. H. Cohen, A Course in Computational Algebraic Number Theory, Graduate Texts in Mathematics 138, Springer-Verlag, Berlin, 2nd printing, 1995.
3. T. J. Dawson, Kangaroos, Scientific American, August 1977, pp. 78-89.
4. M. Gardner, Mathematical games, Scientific American, Feb. 1978, pp. 19-32.
5. J. M. Pollard, Monte Carlo methods for index computation (mod p). Math. Comp., 32 (1978), 918-924.
6. J. M. Pollard, Kruskal's card trick. Math. Gaz., 84 (July 2000), 46-49.
7. A. Stein and E. Teske, Catching kangaroos in function fields, Proceedings of the Conference on the Mathematics of Public-Key Cryptography, Toronto, June 1999.
8. E. Teske, Speeding up Pollard's rho method for computing discrete logarithms, ANTS III (1998), Lecture Notes in Computer Science, Vol. 1423, Springer-Verlag, Berlin, 1998, pp. 541-554.
9. E. Teske, A space efficient algorithm for group structure computation. Math Comp., 67 (1998), 1637-1663.
10. E. Teske, On random walks for Pollard's rho method, Math. Comp., posted on February 18,2000, PII: 5 0025-5718(00)01213-8 (to appear in print).
11. P. C. van Oorschot and M. J. Wiener, Parallel collision search with cryptanalytic applications, J. Cryplology, 12 (1999), 1-28.
12. M. J. Wiener, Personal communications, 6 Oct. and 6 Nov. 1997.