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 "linear 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 "jumps" of the kangaroos, and confirm that powers of two are a good choice (we do not claim they are the best choice).
展开▼
机译：假设已知该值位于特定间隔内，则袋鼠方法会在任意循环组中计算离散对数。 van Oorschot和Wiener给出了“线性加速”的并行版本。我们改进了串行和并行计算机的运行时间分析。我们用袋鼠的“跳跃”来探索运行时间的变化，并确认两个乘方是一个不错的选择（我们并不认为它们是最佳选择）。
展开▼
