1. Ajtai, M., Generating hard instances of lattice problems (Extended Abstract), 28th Annual ACM Symposium on Theory of Computing, ACM Press, New York, 1996, 99–108.
2. Ajtai, M., The shortest vector problem in L2 is NP-hard for randomized reductions (Extended Abstract), 30th Annual ACM Symposium on Theory of Computing, ACM Press, 1998, 10–19.
3. Ajtai, M., Kumar, R. and Sivakumar, D., A sieve algorithm for the shortest lattice vector problem, 33rd Annual ACM Symposium on Theory of Computing, ACM Press, New York, 2001, 601–610.
4. Advances in Cryptology - CRYPTO 2009, Lecture Notes in Computer Science;B Applebaum,2009
5. Becker, A., Ducas, L., Gama, N. and Laarhoven, T., New directions in nearest neighbor searching with applications to lattice sieving, Robert Krauthgamer, editor, 27th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM-SIAM, New York, 2016, 10–24.