1. Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: Proc. of the 28th Symposium on the Theory of Computing, pp. 99–108. ACM Press, New York (1996)
2. Ajtai, M.: The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract). In: Proc. of the 30th Symposium on the Theory of Computing, pp. 10–19. ACM Press, New York (1998)
3. Lecture Notes in Computer Science;A. Akhavi,2004
4. Cassels, J.W.S.: An Introduction to the Geometry of Numbers. Springer, Berlin (1959)
5. Gauss, C.F.: Disquisitiones Arithmeticæ. Leipzig (1801)