On the alpha value of polynomials in the tower number field sieve algorithm.
Aurore GuillevicShashank SinghPublished in: IACR Cryptol. ePrint Arch. (2019)
Keyphrases
- computational complexity
- preprocessing
- expectation maximization
- k means
- execution times
- improved algorithm
- small number
- cost function
- simulated annealing
- space complexity
- times faster
- learning algorithm
- memory requirements
- optimization algorithm
- recognition algorithm
- detection algorithm
- classification algorithm
- high accuracy
- initial set
- optimal solution
- objective function
- selection algorithm
- computational effort
- single scan
- data sets
- polynomial time complexity
- theoretical analysis
- computationally efficient
- particle swarm optimization
- linear programming
- worst case
- motion estimation
- computational cost
- experimental evaluation
- dynamic programming
- np hard
- multiscale