On random walks for Pollard's Rho method
Mathematics of Computation
Handbook of Applied Cryptography
Handbook of Applied Cryptography
The parallelized Pollard kangaroo method in real Quadratic function fields
Mathematics of Computation
Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem
Mathematics of Computation
Efficient batch verification for RSA-Type digital signatures in a ubiquitous environment
EUC'06 Proceedings of the 2006 international conference on Embedded and Ubiquitous Computing
Batch verification with DSA-type digital signatures for ubiquitous computing
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part II
Curve25519: new diffie-hellman speed records
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
| Hi-index | 0.00 |
The Pollard kangaroo method computes discrete logarithms in arbitrary cyclic groups. It is applied if the discrete logarithm is known to lie in a certain interval, say [a, b], and then has expected running time O(√b-a) group operations. In its serial version it uses very little storage. It can be parallelized with linear speed-up, and in its parallelized version its storage requirements can be efficiently monitored. This makes the kangaroo method the most powerful method to solve the discrete logarithm problem in this situation. In this paper, we discuss various experimental and theoretical aspects of the method that are important for its most effective application.