Solving Discrete Logarithm Problem in an Interval Using Periodic Iterates
The Pollard’s kangaroos method can solve the discrete logarithm problem in an interval. We present an improvement of the classic algorithm, which reduces the cost of kangaroos’ jumps by using the sine function to implement periodic iterates and giving some pre-computation. Our experiments show that this improvement is worthy of attention.
KeywordsDiscrete logarithm problem Pollard’s kangaroos method Pollard’s rho method
This work is partially supported by National Key R&D Program of China (2017YFB0802502) and NSF (No. 61272039).
- 1.McCurley, K.: The discrete logarithm problem. In: Proceedings of the Symposium in Applied Mathematics, pp. 49–74. AMS (1990)Google Scholar