Extending Regev's Factoring Algorithm to Compute Discrete Logarithms.
Martin EkeråJoel GärtnerPublished in: PQCrypto (2) (2023)
Keyphrases
- detection algorithm
- times faster
- dynamic programming
- objective function
- computational complexity
- classification algorithm
- k means
- computationally efficient
- np hard
- estimation algorithm
- linear programming
- improved algorithm
- optimization algorithm
- optimal solution
- theoretical analysis
- particle swarm optimization
- similarity measure
- worst case
- computational cost
- experimental evaluation
- cost function
- search space
- preprocessing
- single pass
- learning algorithm
- recognition algorithm
- discrete tomography
- memory requirements
- matching algorithm
- segmentation algorithm
- simulated annealing
- high accuracy
- denoising