The shortest vector problem in L2 is NP-hard for randomized reductions (1998)

by M AJTAI
Venue:In Proceedings of the 30th ACM Symposium on Theory of Computing. ACM