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

Gottfried Herold; Elena Kirshanova; Thijs Laarhoven

doi:10.1007/978-3-319-76578-5_14

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

17 Citations (Scopus)

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
Number of pages	30
ISBN (Electronic)	978-3-319-76578-5
ISBN (Print)	978-3-319-76577-8
DOIs	https://doi.org/10.1007/978-3-319-76578-5_14
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/Territory	Brazil
City	Rio de Janeiro
Period	25/03/18 → 29/03/18
Internet address	https://pkc.iacr.org/2018/

Keywords

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

Access to Document

10.1007/978-3-319-76578-5_14

17 Citations - based on content available in repository [source: Scopus]
1 Article

Faster tuple lattice sieving using spherical locality-sensitive filters
Laarhoven, T., 8 May 2017, In: arXiv. 15 p.
Research output: Contribution to journal › Article › Academic

Open Access
File

Cite this

Herold, G., Kirshanova, E., & Laarhoven, T. (2018). Speed-ups and time–memory trade-offs for tuple lattice sieving. In M. Abdalla, & R. Dahab (Eds.), Public-Key Cryptography – PKC 2018: 21st IACR International Conference on Practice and Theory of Public-Key Cryptography, Rio de Janeiro, Brazil, March 25-29, 2018, Proceedings, Part I (pp. 407-436). (LNCS; Vol. 10769). Springer. https://doi.org/10.1007/978-3-319-76578-5_14

Herold, Gottfried ; Kirshanova, Elena ; Laarhoven, Thijs. / Speed-ups and time–memory trade-offs for tuple lattice sieving. Public-Key Cryptography – PKC 2018: 21st IACR International Conference on Practice and Theory of Public-Key Cryptography, Rio de Janeiro, Brazil, March 25-29, 2018, Proceedings, Part I. editor / M. Abdalla ; R. Dahab. Dordrecht : Springer, 2018. pp. 407-436 (LNCS).

@inproceedings{03714b7be15f48fe95e790a29d1e2660,

title = "Speed-ups and time–memory trade-offs for tuple lattice sieving",

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.",

keywords = "Lattice sieving, Lattice-based cryptography, Nearest neighbor algorithms, Shortest vector problem (SVP)",

author = "Gottfried Herold and Elena Kirshanova and Thijs Laarhoven",

year = "2018",

month = mar,

day = "1",

doi = "10.1007/978-3-319-76578-5_14",

language = "English",

isbn = "978-3-319-76577-8",

series = "LNCS",

publisher = "Springer",

pages = "407--436",

editor = "M. Abdalla and R. Dahab",

booktitle = "Public-Key Cryptography – PKC 2018",

address = "Germany",

note = "21st IACR International Conference on Practice and Theory of Public-Key Cryptography (PKC 2018), PKC2018 ; Conference date: 25-03-2018 Through 29-03-2018",

url = "https://pkc.iacr.org/2018/",

}

Herold, G, Kirshanova, E & Laarhoven, T 2018, Speed-ups and time–memory trade-offs for tuple lattice sieving. in M Abdalla & R Dahab (eds), Public-Key Cryptography – PKC 2018: 21st IACR International Conference on Practice and Theory of Public-Key Cryptography, Rio de Janeiro, Brazil, March 25-29, 2018, Proceedings, Part I. LNCS, vol. 10769, Springer, Dordrecht, pp. 407-436, 21st IACR International Conference on Practice and Theory of Public-Key Cryptography (PKC 2018), Rio de Janeiro, Brazil, 25/03/18. https://doi.org/10.1007/978-3-319-76578-5_14

Speed-ups and time–memory trade-offs for tuple lattice sieving. / Herold, Gottfried; Kirshanova, Elena; Laarhoven, Thijs.
Public-Key Cryptography – PKC 2018: 21st IACR International Conference on Practice and Theory of Public-Key Cryptography, Rio de Janeiro, Brazil, March 25-29, 2018, Proceedings, Part I. ed. / M. Abdalla; R. Dahab. Dordrecht: Springer, 2018. p. 407-436 (LNCS; Vol. 10769).

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

TY - GEN

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

AU - Herold, Gottfried

AU - Kirshanova, Elena

AU - Laarhoven, Thijs

N1 - Conference code: 21

PY - 2018/3/1

Y1 - 2018/3/1

N2 - 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.

AB - 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.

KW - Lattice sieving

KW - Lattice-based cryptography

KW - Nearest neighbor algorithms

KW - Shortest vector problem (SVP)

U2 - 10.1007/978-3-319-76578-5_14

DO - 10.1007/978-3-319-76578-5_14

M3 - Conference contribution

SN - 978-3-319-76577-8

T3 - LNCS

SP - 407

EP - 436

BT - Public-Key Cryptography – PKC 2018

A2 - Abdalla, M.

A2 - Dahab, R.

PB - Springer

CY - Dordrecht

T2 - 21st IACR International Conference on Practice and Theory of Public-Key Cryptography (PKC 2018)

Y2 - 25 March 2018 through 29 March 2018

ER -

Herold G, Kirshanova E, Laarhoven T. Speed-ups and time–memory trade-offs for tuple lattice sieving. In Abdalla M, Dahab R, editors, Public-Key Cryptography – PKC 2018: 21st IACR International Conference on Practice and Theory of Public-Key Cryptography, Rio de Janeiro, Brazil, March 25-29, 2018, Proceedings, Part I. Dordrecht: Springer. 2018. p. 407-436. (LNCS). doi: 10.1007/978-3-319-76578-5_14

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

Abstract

Publication series

Conference

Keywords

Access to Document

Fingerprint

Research output

Faster tuple lattice sieving using spherical locality-sensitive filters

Cite this