Paper 2016/713
Tuple lattice sieving
Shi Bai, Thijs Laarhoven, and Damien Stehle
Abstract
Lattice sieving is asymptotically the fastest approach for solving the shortest vector problem (SVP) on Euclidean lattices. All known sieving algorithms for solving SVP require space which (heuristically) grows as
Note: Updated acknowledgments and added DOI reference
Metadata
- Available format(s)
- Category
- Foundations
- Publication info
- Published elsewhere. Algorithmic Number Theory Symposium (ANTS-XII) 2016
- DOI
- 10.1112/S1461157016000292
- Keywords
- latticesshortest vector problem (SVP)sievingenumeration
- Contact author(s)
- mail @ thijs com
- History
- 2016-09-12: last of 3 revisions
- 2016-07-21: received
- See all versions
- Short URL
- https://ia.cr/2016/713
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2016/713, author = {Shi Bai and Thijs Laarhoven and Damien Stehle}, title = {Tuple lattice sieving}, howpublished = {Cryptology {ePrint} Archive, Paper 2016/713}, year = {2016}, doi = {10.1112/S1461157016000292}, url = {https://eprint.iacr.org/2016/713} }