@InProceedings{aggarwal_et_al:LIPIcs.STACS.2021.4,
author = {Aggarwal, Divesh and Chen, Yanlin and Kumar, Rajendra and Shen, Yixin},
title = {{Improved (Provable) Algorithms for the Shortest Vector Problem via Bounded Distance Decoding}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {4:1--4:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.4},
URN = {urn:nbn:de:0030-drops-136494},
doi = {10.4230/LIPIcs.STACS.2021.4},
annote = {Keywords: Lattices, Shortest Vector Problem, Discrete Gaussian Sampling, Time-Space Tradeoff, Quantum computation, Bounded distance decoding}
}