Collision Bounds for the Additive Pollard Rho Algorithm for Solving Discrete Logarithms.
Joppe W. BosAlina DudeanuDimitar JetchevPublished in: IACR Cryptol. ePrint Arch. (2012)
Keyphrases
- heuristic search
- search space
- detection algorithm
- experimental evaluation
- learning algorithm
- optimization algorithm
- expectation maximization
- cost function
- dynamic programming
- matching algorithm
- linear programming
- upper and lower bounds
- k means
- computational complexity
- recognition algorithm
- upper bound
- times faster
- convex hull
- theoretical analysis
- np hard
- significant improvement
- lower bound
- voronoi diagram
- high accuracy
- collision avoidance
- lower and upper bounds
- worst case
- preprocessing
- similarity measure