Speed-ups and time–memory trade-offs for tuple lattice sieving

Gottfried Herold, Elena Kirshanova, Thijs Laarhoven

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

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 languageEnglish
Title of host publicationPublic-Key Cryptography – PKC 2018
Subtitle of host publication21st IACR International Conference on Practice and Theory of Public-Key Cryptography, Rio de Janeiro, Brazil, March 25-29, 2018, Proceedings, Part I
EditorsM. Abdalla, R. Dahab
Place of PublicationDordrecht
PublisherSpringer
Pages407-436
ISBN (Electronic)978-3-319-76578-5
ISBN (Print)978-3-319-76577-8
DOIs
Publication statusPublished - 1 Mar 2018
Event21st 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

NameLNCS
Volume10769
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference21st IACR International Conference on Practice and Theory of Public-Key Cryptography (PKC 2018)
Abbreviated titlePKC2018
CountryBrazil
CityRio de Janeiro
Period25/03/18 → 29/03/18
Internet address

Keywords

  • Lattice sieving
  • Lattice-based cryptography
  • Nearest neighbor algorithms
  • Shortest vector problem (SVP)

Access to Document

Fingerprint Dive into the research topics of 'Speed-ups and time–memory trade-offs for tuple lattice sieving'. Together they form a unique fingerprint.

Cite this