Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval

The Pollard kangaroo method solves the discrete logarithm problem (DLP) in an interval of size N with heuristic average case expected running time approximately 2 √ N group operations. A recent variant of the kangaroo method, requiring one or two inversions in the

• Type: Journal
• Year: 2010
• Where: PKC
• Authors: Steven D. Galbraith, Raminder S. Ruprai
• Keywords: Cryptology, Discrete Logarithm Problem, Heuristic Average Case, PKC 2010, Pollard Kangaroo