caa a22 4500 475827139 CHVBK 20180406123831.0 cr unu---uuuuu 170329e20000901xx s 000 0 eng 10.1007/s001450010010 doi (NATIONALLICENCE)springer-10.1007/s001450010010 Pollard J. M. Tidmarsh Cottage, Manor Farm Lane, Tidmarsh, Reading RG8 8EX, England jmptidcott@hotmail.com, UK aut Kangaroos, Monopoly and Discrete Logarithms [Elektronische Daten] [J. M. Pollard] Abstract. : The kangaroo method computes a discrete logarithm in an arbitrary cyclic group, given that the value is known to lie in a certain interval. A parallel version has been given by van Oorschot and Wiener with 's'slinear speed-up''. We improve the analysis of the running time, both for serial and parallel computers. We explore the variation of the running time with the set of 's'sjumps'' of the kangaroos, and confirm that powers of two are a good choice (we do not claim they are the best choice). We illustrate the theory with some calculations of interest to Monopoly players, and the method itself with a card trick due to Kruskal. International Association for Criptologic Rese, 2000 Key words. Discrete logarithms, Kangaroo method nationallicence Journal of Cryptology Springer Berlin Heidelberg 13/4(2000-09-01), 437-447 0933-2790 13:4<437 2000 13 145 https://doi.org/10.1007/s001450010010 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/s001450010010 text/html Onlinezugriff via DOI NATIONALLICENCE 100 1- Pollard J. M. Tidmarsh Cottage, Manor Farm Lane, Tidmarsh, Reading RG8 8EX, England jmptidcott@hotmail.com, UK aut NATIONALLICENCE 773 0- Journal of Cryptology Springer Berlin Heidelberg 13/4(2000-09-01), 437-447 0933-2790 13:4<437 2000 13 145 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer