Collision bounds for the additive Pollard rho algorithm for solving discrete logarithms.
Joppe W. BosAlina DudeanuDimitar JetchevPublished in: J. Math. Cryptol. (2014)
Keyphrases
- dynamic programming
- optimal solution
- cost function
- high accuracy
- tight bounds
- experimental evaluation
- search space
- learning algorithm
- optimization algorithm
- probabilistic model
- np hard
- worst case
- segmentation algorithm
- monte carlo
- recognition algorithm
- average case
- continuous domains
- computational complexity
- theoretical analysis
- detection algorithm
- path planning
- times faster
- convex hull
- convergence rate
- lagrange multipliers