17 citations · 54 across the 12 of their papers we have counts for
14 papers
Difficulties Constructing Lattices with Exponential Kissing Number from Codes
Huck Bennett, Alexander Golovnev, Noah Stephens-Davidowitz
In this note, we present examples showing that several natural ways of constructing lattices from error-correcting codes do not in general yield a correspondence between minimum-we…
Recursive lattice reduction -- A framework for finding short lattice vectors
Divesh Aggarwal, Thomas Espitau, Spencer Peters +1
We propose a recursive lattice reduction framework for finding short non-zero vectors or dense sublattices of a lattice. The framework works by recursively searching for dense subl…
A simple proof of a reverse Minkowski theorem for integral lattices
Oded Regev, Noah Stephens-Davidowitz
We prove that for any integral lattice (that is, a lattice such that the inner product …
Lattice Problems Beyond Polynomial Time
Divesh Aggarwal, Huck Bennett, Zvika Brakerski +6
We study the complexity of lattice problems in a world where algorithms, reductions, and protocols can run in superpolynomial time, revisiting four foundational results: two worst-…
A Tight Reverse Minkowski Inequality for the Epstein Zeta Function
Yael Eisenberg, Oded Regev, Noah Stephens-Davidowitz
We prove that if is a lattice such that for all sublattices , then \[ \sum_{\subs…
Dimension-Preserving Reductions Between SVP and CVP in Different -Norms
Divesh Aggarwal, Yanlin Chen, Rajendra Kumar +2
We show a number of reductions between the Shortest Vector Problem and the Closest…