{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T04:27:36Z","timestamp":1778128056487,"version":"3.51.4"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319765778","type":"print"},{"value":"9783319765785","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-76578-5_14","type":"book-chapter","created":{"date-parts":[[2018,2,28]],"date-time":"2018-02-28T09:23:52Z","timestamp":1519809832000},"page":"407-436","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["Speed-Ups and Time\u2013Memory Trade-Offs for Tuple Lattice Sieving"],"prefix":"10.1007","author":[{"given":"Gottfried","family":"Herold","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elena","family":"Kirshanova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thijs","family":"Laarhoven","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,1]]},"reference":[{"key":"14_CR1","unstructured":"Alkim, E., Ducas, L., P\u00f6ppelmann, T., Schwabe, P.: Post-quantum key exchange - a new hope. In: USENIX Security Symposium, pp. 327\u2013343 (2016)"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Aggarwal, D., Dadush, D., Regev, O., Stephens-Davidowitz, N.: Solving the shortest vector problem in \n$$2^n$$\n time via discrete Gaussian sampling. In: STOC, pp. 733\u2013742 (2015)","DOI":"10.1145\/2746539.2746606"},{"issue":"8","key":"14_CR3","doi-asserted-by":"publisher","first-page":"2201","DOI":"10.1109\/TIT.2002.800499","volume":"48","author":"E Agrell","year":"2002","unstructured":"Agrell, E., Eriksson, T., Vardy, A., Zeger, K.: Closest point search in lattices. IEEE Trans. Inf. Theor. 48(8), 2201\u20132214 (2002)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"14_CR4","unstructured":"Andoni, A., Indyk, P., Laarhoven, T., Razenshteyn, I., Schmidt, L.: Practical and optimal LSH for angular distance. In: NIPS, pp. 1225\u20131233 (2015)"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Andoni, A., Indyk, P., Nguy\u00ean, H., Razenshteyn, I.: Beyond locality-sensitive hashing. In: SODA, pp. 1018\u20131028 (2014)","DOI":"10.1137\/1.9781611973402.76"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: STOC, pp. 601\u2013610 (2001)","DOI":"10.1145\/380752.380857"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Andoni, A., Laarhoven, T., Razenshteyn, I., Waingarten, E.: Optimal hashing-based time-space trade-offs for approximate near neighbors. In: SODA, pp. 47\u201366 (2017)","DOI":"10.1137\/1.9781611974782.4"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-319-56614-6_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"Y Aono","year":"2017","unstructured":"Aono, Y., Nguyen, P.Q.: Random sampling revisited: lattice enumeration with discrete pruning. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10211, pp. 65\u2013102. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56614-6_3"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Becker, A., Ducas, L., Gama, N., Laarhoven, T.: New directions in nearest neighbor searching with applications to lattice sieving. In: SODA, pp. 10\u201324 (2016)","DOI":"10.1137\/1.9781611974331.ch2"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Becker, A., Gama, N., Joux, A.: A sieve algorithm based on overlattices. In: ANTS, pp. 49\u201370 (2014)","DOI":"10.1112\/S1461157014000229"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Becker, A., Laarhoven, T.: Efficient (ideal) lattice sieving using cross-polytope LSH. In: AFRICACRYPT, pp. 3\u201323 (2016)","DOI":"10.1007\/978-3-319-31517-1_1"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Bai, S., Laarhoven, T., Stehl\u00e9, D.: Tuple lattice sieving. In: ANTS, pp. 146\u2013162 (2016)","DOI":"10.1112\/S1461157016000292"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Christiani, T.: A framework for similarity search with space-time tradeoffs using locality-sensitive filtering. In: SODA, pp. 31\u201346 (2017)","DOI":"10.1137\/1.9781611974782.3"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-25385-0_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"Y Chen","year":"2011","unstructured":"Chen, Y., Nguyen, P.Q.: BKZ 2.0: better lattice security estimates. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 1\u201320. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_1"},{"issue":"170","key":"14_CR15","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1090\/S0025-5718-1985-0777278-8","volume":"44","author":"U Fincke","year":"1985","unstructured":"Fincke, U., Pohst, M.: Improved methods for calculating vectors of short length in a lattice. Math. Comput. 44(170), 463\u2013471 (1985)","journal-title":"Math. Comput."},{"issue":"3","key":"14_CR16","first-page":"165","volume":"15","author":"D Goldstein","year":"2006","unstructured":"Goldstein, D., Mayer, A.: On the equidistribution of hecke points. Forum Math. 15(3), 165\u2013189 (2006)","journal-title":"Forum Math."},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-642-13190-5_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"N Gama","year":"2010","unstructured":"Gama, N., Nguyen, P.Q., Regev, O.: Lattice enumeration using extreme pruning. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 257\u2013278. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_13"},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-662-54365-8_2","volume-title":"Public-Key Cryptography \u2013 PKC 2017","author":"G Herold","year":"2017","unstructured":"Herold, G., Kirshanova, E.: Improved algorithms for the approximate k-list problem in Euclidean norm. In: Fehr, S. (ed.) PKC 2017. LNCS, vol. 10174, pp. 16\u201340. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54365-8_2"},{"key":"14_CR19","unstructured":"Herold, G., Kirshanova, E., Laarhoven, T.: Speed-ups and time-memory trade-offs for tuple lattice sieving (2017). eprint.iacr.org\/2017\/1228"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Kannan, R.: Improved algorithms for integer programming and related lattice problems. In: STOC, pp. 193\u2013206 (1983)","DOI":"10.1145\/800061.808749"},{"key":"14_CR21","unstructured":"Klein, P.: Finding the closest lattice vector when it\u2019s unusually close. In: SODA, pp. 937\u2013941 (2000)"},{"key":"14_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-47989-6_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"T Laarhoven","year":"2015","unstructured":"Laarhoven, T.: Sieving for shortest vectors in lattices using angular locality-sensitive hashing. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9215, pp. 3\u201322. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_1"},{"key":"14_CR23","unstructured":"Laarhoven, T.: Tradeoffs for nearest neighbors on the sphere. arXiv, pp. 1\u201316 (2015)"},{"key":"14_CR24","unstructured":"Laarhoven, T.: Finding closest lattice vectors using approximate Voronoi cells. Cryptology ePrint Archive, Report 2016\/888 (2016)"},{"key":"14_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-319-22174-8_6","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2015","author":"T Laarhoven","year":"2015","unstructured":"Laarhoven, T., de Weger, B.: Faster sieving for shortest lattice vectors using spherical locality-sensitive hashing. In: Lauter, K., Rodr\u00edguez-Henr\u00edquez, F. (eds.) LATINCRYPT 2015. LNCS, vol. 9230, pp. 101\u2013118. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-22174-8_6"},{"issue":"2","key":"14_CR26","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s10623-015-0067-5","volume":"77","author":"T Laarhoven","year":"2015","unstructured":"Laarhoven, T., Mosca, M., van de Pol, J.: Finding shortest lattice vectors faster using quantum search. Des. Codes Crypt. 77(2), 375\u2013400 (2015)","journal-title":"Des. Codes Crypt."},{"key":"14_CR27","unstructured":"Lindner, R., R\u00fcckert, M., Baumann, P., Nobach, L.: SVP challenge generator. https:\/\/latticechallenge.org\/svp-challenge"},{"key":"14_CR28","unstructured":"Standard Worksheet Interface, Maple 2016.0, build id 1113130, 17 February 2016"},{"key":"14_CR29","doi-asserted-by":"crossref","unstructured":"Mariano, A., Laarhoven, T., Bischof, C.: Parallel (probable) lock-free HashSieve: a practical sieving algorithm for the SVP. In: ICPP, pp. 590\u2013599 (2015)","DOI":"10.1109\/ICPP.2015.68"},{"key":"14_CR30","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Voulgaris, P.: Faster exponential time algorithms for the shortest vector problem. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, pp. 1468\u20131480 (2010)","DOI":"10.1137\/1.9781611973075.119"},{"key":"14_CR31","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1515\/JMC.2008.009","volume":"2","author":"PQ Nguyen","year":"2008","unstructured":"Nguyen, P.Q., Vidick, T.: Sieve algorithms for the shortest vector problem are practical. J. Math. Cryptol. 2, 181\u2013207 (2008)","journal-title":"J. Math. Cryptol."},{"issue":"1","key":"14_CR32","doi-asserted-by":"crossref","first-page":"5:1","DOI":"10.1145\/2578221","volume":"6","author":"R O\u2019Donnell","year":"2014","unstructured":"O\u2019Donnell, R., Yi, W., Zhou, Y.: Optimal lower bounds for locality-sensitive hashing (except when \n$$q$$\n is tiny). ACM Trans. Comput. Theor. 6(1), 5:1\u20135:13 (2014)","journal-title":"ACM Trans. Comput. Theor."},{"key":"14_CR33","unstructured":"Pujol, X., Stehl\u00e9, D.: Solving the shortest lattice vector problem in time \n$$2^{2.465n}$$\n. Cryptology ePrint Archive, Report 2009\/605, pp. 1\u20137 (2009)"},{"key":"14_CR34","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: STOC, pp. 84\u201393 (2005)","DOI":"10.1145\/1060590.1060603"},{"issue":"2\u20133","key":"14_CR35","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-3975(87)90064-8","volume":"53","author":"C-P Schnorr","year":"1987","unstructured":"Schnorr, C.-P.: A hierarchy of polynomial time lattice basis reduction algorithms. Theor. Comput. Sci. 53(2\u20133), 201\u2013224 (1987)","journal-title":"Theor. Comput. Sci."},{"issue":"2\u20133","key":"14_CR36","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01581144","volume":"66","author":"C-P Schnorr","year":"1994","unstructured":"Schnorr, C.-P., Euchner, M.: Lattice basis reduction: improved practical algorithms and solving subset sum problems. Math. Program. 66(2\u20133), 181\u2013199 (1994)","journal-title":"Math. Program."},{"key":"14_CR37","doi-asserted-by":"crossref","unstructured":"Wang, X., Liu, M., Tian, C., Bi, J.: Improved Nguyen-Vidick heuristic sieve algorithm for shortest vector problem. In: ASIACCS, pp. 1\u20139 (2011)","DOI":"10.1145\/1966913.1966915"},{"key":"14_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-662-43414-7_2","volume-title":"Selected Areas in Cryptography \u2013 SAC 2013","author":"F Zhang","year":"2014","unstructured":"Zhang, F., Pan, Y., Hu, G.: A three-level sieve algorithm for the shortest vector problem. In: Lange, T., Lauter, K., Lison\u011bk, P. (eds.) SAC 2013. LNCS, vol. 8282, pp. 29\u201347. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43414-7_2"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2018"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-76578-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,5]],"date-time":"2021-03-05T01:11:23Z","timestamp":1614906683000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-76578-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319765778","9783319765785"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-76578-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"1 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PKC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IACR International Workshop on Public Key Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rio de Janeiro","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazil","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 March 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 March 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pkc2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pkc.iacr.org\/2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}