New Complexity Trade-Offs for the (Multiple) Number Field Sieve Algorithm in Non-Prime Fields.
Palash SarkarShashank SinghPublished in: EUROCRYPT (1) (2016)
Keyphrases
- computational complexity
- space complexity
- experimental evaluation
- trade off
- worst case
- computational cost
- preprocessing
- worst case time complexity
- detection algorithm
- execution times
- optimization algorithm
- times faster
- small number
- polynomial time complexity
- computational effort
- tree structure
- theoretical analysis
- np complete
- learning algorithm
- high accuracy
- memory requirements
- objective function
- np hard
- cost function
- randomized algorithm
- improved algorithm
- expectation maximization
- segmentation algorithm
- dynamic programming
- k means
- optimal solution
- computer vision
- clustering method
- matching algorithm
- simulated annealing
- probabilistic model
- convergence rate
- search space
- undirected graph
- initial set
- lower bound
- single scan
- image sequences