Computing Square Roots Faster than the Tonelli-Shanks/Bernstein Algorithm.
Palash SarkarPublished in: IACR Cryptol. ePrint Arch. (2020)
Keyphrases
- experimental evaluation
- significant improvement
- learning algorithm
- cost function
- objective function
- computational complexity
- improved algorithm
- k means
- detection algorithm
- optimal solution
- selection algorithm
- energy function
- computationally efficient
- optimization algorithm
- high accuracy
- highly efficient
- computationally demanding
- search space
- preprocessing
- face recognition
- simulated annealing
- particle swarm optimization
- knn
- theoretical analysis
- computational cost
- np hard
- evolutionary algorithm
- ant colony optimization
- tree structure
- matching algorithm
- times faster
- convex hull
- clustering algorithm