A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic.
Razvan BarbulescuPierrick GaudryAntoine JouxEmmanuel ThoméPublished in: EUROCRYPT (2014)
Keyphrases
- dynamic programming
- experimental evaluation
- learning algorithm
- optimization algorithm
- computational cost
- optimal solution
- preprocessing
- objective function
- expectation maximization
- high accuracy
- running times
- heuristic methods
- convex hull
- times faster
- simulated annealing
- search space
- computational complexity
- search algorithm
- markov random field
- genetic algorithm
- cost function
- k means
- detection algorithm
- matching algorithm
- knapsack problem
- finite number
- decision trees
- discrete version