How long does it take to catch a wild kangaroo?

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2009, Pages 553-559

  Montenegro, Ravi ^a   Tetali, Prasad ^b  

^a University of Massachusetts Lowell   (United States)

^b Georgia Institute of Technology   (United States)

Author keywords

Digital signature; Discrete logarithm; Markov chain; Mixing time; Pollard's kangaroo method

Indexed keywords

DIGITAL SIGNATURE; DISCRETE LOGARITHM; MARKOV CHAIN; MIXING TIME; POLLARD'S KANGAROO METHOD;

ALGEBRA; AUTHENTICATION; HARVESTING; MARKOV PROCESSES;

COMPUTATION THEORY;

EID: 70350664633     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1536414.1536490     Document Type: Conference Paper

References (8)

1. D. Boneh and X. Boyen, \Short Signatures Without Random Oracles," Proc. of Eurocrypt 2004, LNCS 3027, pp. 56{73 (2004).
2. J-H. Kim, R. Montenegro, Y. Peres and P. Tetali, \A Birthday Paradox for Markov chains, with an optimal bound for collision in the Pollard Rho Algorithm for Discrete Logarithm," Proc. of the 8th Algorithmic Number Theory Symposium (ANTS-VIII), Springer LNCS vol. 5011, pp. 402{415 (2008).
3. J. Lagarias, E. Rains and R.J. Vanderbei, \The Kruskal Count," in The Mathematics of Preference, Choice and Order. Essays in Honor of Peter J. Fishburn, (Stephen Brams, William V. Gehrlein and Fred S. Roberts, Eds.), Springer-Verlag: Berlin Heidelberg, pp. 371{391 (2009).
4. S. Miller and R. Venkatesan, \Spectral Analysis of Pollard Rho Collisions," Proc. of the 7th Algorithmic Number Theory Symposium (ANTS-VII), Springer LNCS vol. 4076, pp. 573{581 (2006).
5. P.C. van Oorschot and M.J. Wiener, \Parallel collision search with cryptanalytic applications," Journal of Cryptology, vol. 12 no. 1, pp. 1{28 (1999).
6. J. Pollard, \Monte Carlo methods for index computation mod p," Mathematics of Computation, vol. 32 no. 143, pp. 918{924 (1978).
7. J. Pollard, \Kangaroos, Monopoly and Discrete Logarithms," Journal of Cryptology, vol. 13 no. 4, pp. 437{447 (2000).
8. E. Teske, \Square-root Algorithms for the Discrete Logarithm Problem (A Survey)," in Public-Key Cryptography and Computational Number Theory, Walter de Gruyter, Berlin - New York, pp. 283{301 (2001).