Polynomial Time Bounded Distance Decoding near Minkowski's Bound in Discrete Logarithm Lattices.
Léo DucasCécile PierrotPublished in: IACR Cryptol. ePrint Arch. (2018)
Keyphrases
- worst case
- distance transform
- distance metric
- upper bound
- lower bound
- distance measure
- computational complexity
- bounded treewidth
- euclidean distance
- distance function
- special case
- asymptotically optimal
- complexity bounds
- discrete version
- approximation algorithms
- continuous variables
- minimum distance
- continuous functions
- discrete variables
- discrete geometry
- real valued functions