We study the complexity of lattice problems in a world where algorithms,...
We show a number of reductions between the
Shortest Vector Problem and t...
In this work, we show the first worst-case to average-case reduction for...
We show a 2^n/2+o(n)-time algorithm that finds a (non-zero) vector in a
...
We show that the Closest Vector Problem in the ℓ_p norm
(CVP_p) cannot b...
We show how to generalize Gama and Nguyen's slide reduction algorithm [S...
For 0 ≤α≤ 1/2, we show an algorithm that does the following.
Given appro...
We prove the
following quantitative hardness results for the Shortest ...