Abstract
In this work we study speed-ups and time–space trade-offs for solving the shortest vector problem (SVP) on Euclidean lattices based on tuple lattice sieving.
Original language | English |
---|---|
Title of host publication | Public-Key Cryptography – PKC 2018 |
Subtitle of host publication | 21st IACR International Conference on Practice and Theory of Public-Key Cryptography, Rio de Janeiro, Brazil, March 25-29, 2018, Proceedings, Part I |
Editors | M. Abdalla, R. Dahab |
Place of Publication | Dordrecht |
Publisher | Springer |
Pages | 407-436 |
ISBN (Electronic) | 978-3-319-76578-5 |
ISBN (Print) | 978-3-319-76577-8 |
DOIs | |
Publication status | Published - 1 Mar 2018 |
Event | 21st IACR International Conference on Practice and Theory of Public-Key Cryptography (PKC 2018) - Rio de Janeiro, Brazil Duration: 25 Mar 2018 → 29 Mar 2018 Conference number: 21 https://pkc.iacr.org/2018/ |
Publication series
Name | LNCS |
---|---|
Volume | 10769 |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 21st IACR International Conference on Practice and Theory of Public-Key Cryptography (PKC 2018) |
---|---|
Abbreviated title | PKC2018 |
Country | Brazil |
City | Rio de Janeiro |
Period | 25/03/18 → 29/03/18 |
Internet address |
Keywords
- Lattice sieving
- Lattice-based cryptography
- Nearest neighbor algorithms
- Shortest vector problem (SVP)