1. Aggarwal, D., Dadush, D., Regev, O., Stephens-Davidowitz, N.: Solving the shortest vector problem in $$2^n$$ time via discrete gaussian sampling. In: STOC (2015).
http://arxiv.org/abs/1412.7994
2. Ajtai, M.: Generating hard instances of lattice problems. In: STOC (1996)
3. Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: STOC (2001)
4. Aggarwal, D., Stephens-Davidowitz, N.: Just take the average! An embarrassingly simple $$2^n$$-time algorithm for SVP (and CVP). In: SOSA (2018).
http://arxiv.org/abs/1709.01535
5. Becker, A., Ducas, L., Gama, N., Laarhoven, T.: New directions in nearest neighbor searching with applications to lattice sieving. In: SODA (2016)