Approximate cvpp in time 20.802 n
F Eisenbrand, M Venzin - Journal of Computer and System Sciences, 2022 - Elsevier
We show that a constant factor approximation of the shortest and closest lattice vector
problem in any ℓ p-norm can be computed in time 2 (0.802+ ε) n. This matches the currently …
problem in any ℓ p-norm can be computed in time 2 (0.802+ ε) n. This matches the currently …
Approximate in Time - Now in Any Norm!
T Rothvoss, M Venzin - International Conference on Integer Programming …, 2022 - Springer
We show that a constant factor approximation of the shortest and closest lattice vector
problem in any norm can be computed in time 2 0.802 n. This contrasts the corresponding 2 …
problem in any norm can be computed in time 2 0.802 n. This contrasts the corresponding 2 …
Covering convex bodies and the closest vector problem
We present algorithms for the (1+ ϵ)-approximate version of the closest vector problem for
certain norms. The currently fastest algorithm (Dadush and Kun 2016) for general norms in …
certain norms. The currently fastest algorithm (Dadush and Kun 2016) for general norms in …
[PDF][PDF] 格上筛法研究现状与发展趋势
毕蕾， 路献辉， 王鲲鹏 - Journal of Cryptologic Research, 2021 - jcr.cacrnet.org.cn
最短向量问题(shortest vector problem, SVP) 是格上的基础困难问题之一,
是格密码方案安全性的基础假设, SVP 求解算法是评估格密码算法具体安全性的关键技术 …
是格密码方案安全性的基础假设, SVP 求解算法是评估格密码算法具体安全性的关键技术 …
A Survey of Algorithms for Addressing the Shortest Vector Problem (SVP)
E He, T Xu, M Wu, J Chen, S Yao, P Li - International Conference on …, 2023 - Springer
Lattice-based encryption schemes derive their security from the presumed complexity of
solving the Shortest Vector Problem (SVP) within the lattice structure. Numerous algorithms …
solving the Shortest Vector Problem (SVP) within the lattice structure. Numerous algorithms …
[PDF][PDF] Geometric Considerations in Lattice Programming
MA Venzin - 2023 - infoscience.epfl.ch
In this thesis we consider the shortest and the closest vector problem in general norms· K.
For lattices of rank n, we show that both of these problems admit an O (1)-approximation in O …
For lattices of rank n, we show that both of these problems admit an O (1)-approximation in O …
Approximate in time
F Eisenbrand, M Venzin - arXiv preprint arXiv:2005.04957, 2020 - arxiv.org
We show that a constant factor approximation of the shortest and closest lattice vector
problem wrt any $\ell_p $-norm can be computed in time $2^{(0.802+{\epsilon})\, n} $. This …
problem wrt any $\ell_p $-norm can be computed in time $2^{(0.802+{\epsilon})\, n} $. This …