## Approximating Shortest Lattice Vectors is Not Harder Than Approximating Closest Lattice Vectors

- Oded Goldreich, Daniele Micciancio, Shmuel Safra, Jean-Pierre Seifert
- Electronic Colloquium on Computational Complexity
- 1999

Highly Influential

@inproceedings{Aggarwal2018ImprovedAF, title={Improved algorithms for the Shortest Vector Problem and the Closest Vector Problem in the infinity norm}, author={Divesh Aggarwal and Priyanka Mukhopadhyay}, year={2018} }

- Published 2018

Blomer and Naewe [10] modified the randomized sieving algorithm of Ajtai, Kumar and Sivakumar [4] to solve the shortest vector problem (SVP). The algorithm starts with N = 2 randomly chosen vectors in the lattice and employs a sieving procedure to iteratively obtain shorter vectors in the lattice. The running time of the sieving procedure is quadratic in N . We study this problem for the special but important case of the l∞ norm. We give a new sieving procedure that runs in time linear in N… CONTINUE READING