Solving the Shortest Vector Problem in 2 n Time Using Discrete Gaussian Sampling
Work
Year: 2015
Type: article
Abstract: We give a randomized 2n+o(n)-time and space algorithm for solving the Shortest Vector Problem (SVP) on n-dimensional Euclidean lattices. This improves on the previous fastest algorithm: the determinis... more
Institutions École Polytechnique Fédérale de Lausanne, Centrum Wiskunde & Informatica, New York University
Cites: 61
Cited by: 86
Related to: 10
FWCI: 5.773
Citation percentile (by year/subfield): 99.99
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Grant IDS CCF-1320188,