Computing Individual Discrete Logarithms Faster in GF(p n ) with the NFS-DL Algorithm.

Aurore Guillevic

Published in: ASIACRYPT (1) (2015)

Keyphrases

computationally efficient
experimental evaluation
high accuracy
dynamic programming
computational complexity
worst case
cost function

learning algorithm
highly efficient
improved algorithm
simulated annealing
np hard
preprocessing
k means

description logics
search space
linear programming
detection algorithm
significant improvement
input data

optimization algorithm
objective function
data sets
memory efficient
continuous optimization
discrete version