Ishay Haviv, Oded Regev. Tensor-based hardness of the shortest vector problem to within almost polynomial factors. In David S. Johnson, Uriel Feige, editors, Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007. pages 469-477, ACM, 2007. [doi]
Abstract is missing.