1. Aggarwal D., Dadush D., Regev O., Stephens-Davidowitz N.: Solving the shortest vector problem in $$2^{{\rm n}}$$ 2 n time via discrete gaussian sampling. In: Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing (STOC ’15), pp. 733–742. ACM, New York (2015).
2. Ajtai M., Kumar R., Sivakumar D.: A sieve algorithm for the shortest lattice vector problem. In: Proceedings of STOC, pp. 601–610 (2001).
3. Albrecht M., Faugére J.-C., Fitzpatrick R., Perret L.: Lazy Modulus Switching for the BKW Algorithm on LWE. Lecture Notes in Computer Science, vol. 8383, pp. 429–445. Springer, Berlin (2014).
4. Albrecht M.R., Player R., Scott S.: On the concrete hardness of learning with errors. Cryptology ePrint Archive, Report 2015/046 (2015).
5. Albrecht M., Cid C., Faugére J.C., Fitzpatrick R., Perret L.: On the complexity of the bkw algorithm on lwe. Des. Codes Cryptogr. 74(2), 325–354 (2013).