Divesh Aggarwal

most citedSolving the Shortest Vector Problem in

2^{n}

Time via Discrete Gaussian Sampling

41 citations · 41 across the 1 of their papers we have counts for

collaborators

Showing cs.DSShow all

1 paper · 1 filter

cs.DS2014★ 41 cited

Solving the Shortest Vector Problem in $2^{n}$ Time via Discrete Gaussian Sampling

Divesh Aggarwal, Daniel Dadush, Oded Regev +1

We give a randomized $2^{n + o (n)}$ -time and space algorithm for solving the Shortest Vector Problem (SVP) on n-dimensional Euclidean lattices. This improves on the previous fastest…

Solving the Shortest Vector Problem in 2n Time via Discrete Gaussian Sampling

Solving the Shortest Vector Problem in $2^{n}$ Time via Discrete Gaussian Sampling