A reverse Minkowski theorem
From MaRDI portal
Publication:4978036
DOI10.1145/3055399.3055434zbMath1370.11073arXiv1611.05979OpenAlexW2553330945MaRDI QIDQ4978036
Noah Stephens-Davidowitz, Oded Regev
Publication date: 17 August 2017
Published in: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.05979
Related Items (10)
Adaptively secure distributed PRFs from LWE ⋮ A proof of the conjectured run time of the Hafner-McCurley class group algorithm ⋮ Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice ⋮ On lattice extensions ⋮ Some questions related to the reverse Minkowski theorem ⋮ Mathematics of computation through the lens of linear equations and lattices ⋮ A counterexample to a strong variant of the Polynomial Freiman-Ruzsa conjecture in Euclidean space ⋮ Euclidean lattices, theta invariants, and thermodynamic formalism ⋮ A proof of a conjecture by Haviv, Lyubashevsky and Regev on the second moment of a lattice Voronoi cell ⋮ A \(2^{n/2}\)-time algorithm for \(\sqrt{n} \)-SVP and \(\sqrt{n} \)-Hermite SVP, and an improved time-approximation tradeoff for (H)SVP
This page was built for publication: A reverse Minkowski theorem
