A Simple an Fast Probabilistic Algorithm for Computing Square Roots Modulo a Prime Number.
René PeraltaJeroen van de GraafPublished in: EUROCRYPT (1986)
Keyphrases
- computational complexity
- optimization algorithm
- space complexity
- preprocessing
- times faster
- dynamic programming
- learning algorithm
- theoretical analysis
- computational cost
- simulated annealing
- high accuracy
- computational effort
- particle swarm optimization
- worst case
- probabilistic model
- experimental evaluation
- np hard
- detection algorithm
- cost function
- convex hull
- recognition algorithm
- search space
- neural network
- small number
- input data
- objective function
- cluster centers
- single scan
- polynomial time complexity