Login / Signup
Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms - Simplified Setting for Small Characteristic Finite Fields.
Antoine Joux
Cécile Pierrot
Published in:
IACR Cryptol. ePrint Arch. (2014)
Keyphrases
</>
computational complexity
worst case
continuous domains
computational cost
computationally efficient
significant improvement
data structure
data sets
computer vision
optimization problems
data mining
computational efficiency
times faster
finite number
special case
theoretical analysis
neural network