A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic.
Razvan BarbulescuPierrick GaudryAntoine JouxEmmanuel ThoméPublished in: IACR Cryptol. ePrint Arch. (2013)
Keyphrases
- dynamic programming
- detection algorithm
- high accuracy
- optimal solution
- times faster
- matching algorithm
- worst case
- computational cost
- segmentation algorithm
- optimization algorithm
- preprocessing
- computational complexity
- convex hull
- learning algorithm
- experimental evaluation
- theoretical analysis
- recognition algorithm
- improved algorithm
- computationally efficient
- cost function
- search space
- objective function
- data sets
- np hard
- significant improvement
- k means
- image segmentation
- computer vision
- polynomially bounded