Improved Analysis of Kannan's Shortest Lattice Vector Algorithm.
Guillaume HanrotDamien StehléPublished in: CRYPTO (2007)
Keyphrases
- improved algorithm
- high accuracy
- learning algorithm
- dynamic programming
- cost function
- computational complexity
- optimization algorithm
- expectation maximization
- k means
- computationally efficient
- lattice structure
- preprocessing
- recognition algorithm
- matching algorithm
- input data
- worst case
- simulated annealing
- np hard
- theoretical analysis
- segmentation algorithm
- search space
- detection algorithm
- significant improvement
- computational cost
- multi objective