{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T10:44:54Z","timestamp":1777632294091,"version":"3.51.4"},"publisher-location":"Cham","reference-count":47,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319221731","type":"print"},{"value":"9783319221748","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-22174-8_6","type":"book-chapter","created":{"date-parts":[[2015,8,14]],"date-time":"2015-08-14T16:28:06Z","timestamp":1439569686000},"page":"101-118","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["Faster Sieving for Shortest Lattice Vectors Using Spherical Locality-Sensitive Hashing"],"prefix":"10.1007","author":[{"given":"Thijs","family":"Laarhoven","sequence":"first","affiliation":[]},{"given":"Benne","family":"de Weger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,15]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, D., Dadush, D., Regev, O., Stephens-Davidowitz, N.: Solving the shortest vector problem in $$2^n$$ time via discrete gaussian sampling. In: STOC (2015)","DOI":"10.1109\/FOCS.2015.41"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: The shortest vector problem in $$L_2$$ is NP-hard for randomized reductions (extended abstract). In: STOC, pp. 10\u201319 (1998)","DOI":"10.1145\/276698.276705"},{"key":"6_CR3","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":"6_CR4","doi-asserted-by":"crossref","unstructured":"Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In: FOCS, pp. 459\u2013468 (2006)","DOI":"10.1109\/FOCS.2006.49"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Andoni, A., Indyk, P., Nguyen, H.L., Razenshteyn, I.: Beyond locality-sensitive hashing. In: SODA, pp. 1018\u20131028 (2014)","DOI":"10.1137\/1.9781611973402.76"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Andoni, A., Razenshteyn, I.: Optimal data-dependent hashing for approximate near neighbors. In: STOC (2015)","DOI":"10.1145\/2746539.2746553"},{"key":"6_CR7","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":"6_CR8","unstructured":"Becker, A., Gama, N., Joux, A.: Speeding-up lattice sieving without increasing the memory, using sub-quadratic nearest neighbor search. Cryptology ePrint Archive, Report 2015\/522 (2015)"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Becker, A., Laarhoven, T.: Efficient sieving on (ideal) lattices using cross-polytopic LSH. (preprint 2015)","DOI":"10.1007\/978-3-319-31517-1_1"},{"key":"6_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88702-7","volume-title":"Post-Quantum Cryptography","author":"DJ Bernstein","year":"2009","unstructured":"Bernstein, D.J., Buchmann, J., Dahmen, E.: Post-Quantum Cryptography. Springer, Heidelberg (2009)"},{"key":"6_CR11","unstructured":"Bos, J., Naehrig, M., van de Pol, J.: Sieving for shortest vectors in ideal lattices: a practical perspective. Cryptology ePrint Archive, Report 2014\/880 (2014)"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Charikar, M.S.: Similarity estimation techniques from rounding algorithms. In: STOC, pp. 380\u2013388 (2002)","DOI":"10.1145\/509907.509965"},{"key":"6_CR13","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)"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Datar, M., Immorlica, N., Indyk, P., Mirrokni, V.S.: Locality-sensitive hashing scheme based on $$p$$-stable distributions. In: SOCG, pp. 253\u2013262 (2004)","DOI":"10.1145\/997817.997857"},{"issue":"170","key":"6_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."},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1007\/978-3-319-16295-9_16","volume-title":"Progress in Cryptology - LATINCRYPT 2014","author":"R Fitzpatrick","year":"2015","unstructured":"Fitzpatrick, R., Bischof, C., Buchmann, J., Dagdelen, \u00d6., G\u00f6pfert, F., Mariano, A., Yang, B.-Y.: Tuning gausssieve for speed. In: Aranha, D.F., Menezes, A. (eds.) LATINCRYPT 2014. LNCS, vol. 8895, pp. 288\u2013305. Springer, Heidelberg (2015)"},{"key":"6_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)"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: STOC, pp. 169\u2013178 (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-642-20901-7_10","volume-title":"Coding and Cryptology","author":"G Hanrot","year":"2011","unstructured":"Hanrot, G., Pujol, X., Stehl\u00e9, D.: Algorithms for the shortest and closest lattice vector problems. In: Chee, Y.M., Guo, Z., Ling, S., Shao, F., Tang, Y., Wang, H., Xing, C. (eds.) IWCC 2011. LNCS, vol. 6639, pp. 159\u2013190. Springer, Heidelberg (2011)"},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BFb0054868","volume-title":"Algorithmic Number Theory","author":"J Hoffstein","year":"1998","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: a ring-based public key cryptosystem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 267\u2013288. Springer, Heidelberg (1998)"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: STOC, pp. 604\u2013613 (1998)","DOI":"10.1145\/276698.276876"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Ishiguro, T., Kiyomoto, S., Miyake, Y., Takagi, T.: Parallel gauss sieve algorithm: solving the SVP challenge over a $$128$$-dimensional ideal lattice. In: PKC, pp. 411\u2013428 (2014)","DOI":"10.1007\/978-3-642-54631-0_24"},{"key":"6_CR23","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":"6_CR24","doi-asserted-by":"crossref","unstructured":"Laarhoven, T.: Sieving for shortest vectors in lattices using angular locality-sensitive hashing. In: CRYPTO (2015)","DOI":"10.1007\/978-3-662-47989-6_1"},{"key":"6_CR25","doi-asserted-by":"crossref","unstructured":"Laarhoven, T., Mosca, M., van de Pol, J.: Finding shortest lattice vectors faster using quantum search. Des., Codes Crypt. (2015)","DOI":"10.1007\/s10623-015-0067-5"},{"key":"6_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-642-19074-2_21","volume-title":"Topics in Cryptology \u2013 CT-RSA 2011","author":"R Lindner","year":"2011","unstructured":"Lindner, R., Peikert, C.: Better key sizes (and attacks) for LWE-based encryption. In: Kiayias, A. (ed.) CT-RSA 2011. LNCS, vol. 6558, pp. 319\u2013339. Springer, Heidelberg (2011)"},{"key":"6_CR27","doi-asserted-by":"crossref","unstructured":"Mariano, A., Timnat, S., Bischof, C.: Lock-free gausssieve for linear speedups in parallel high performance SVP calculation. In: SBAC-PAD, pp. 278\u2013285 (2014)","DOI":"10.1109\/SBAC-PAD.2014.18"},{"key":"6_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1007\/978-3-319-14325-5_5","volume-title":"Euro-Par 2014: Parallel Processing Workshops","author":"A Mariano","year":"2014","unstructured":"Mariano, A., Dagdelen, \u00d6., Bischof, C.: A comprehensive empirical comparison of parallel listsieve and gausssieve. In: Lopes, L., et al. (eds.) Euro-Par 2014 Workshops. LNCS, pp. 48\u201359. Springer, Heidelberg (2014)"},{"key":"6_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 (2015)","DOI":"10.1109\/ICPP.2015.68"},{"key":"6_CR30","doi-asserted-by":"crossref","unstructured":"Micciancio, D.: The shortest vector in a lattice is hard to approximate to within some constant. In: FOCS, pp. 92\u201398 (1998)","DOI":"10.1109\/SFCS.1998.743432"},{"key":"6_CR31","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Voulgaris, P.: A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations. In: STOC, pp. 351\u2013358 (2010)","DOI":"10.1145\/1806689.1806739"},{"key":"6_CR32","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Voulgaris, P.: Faster exponential time algorithms for the shortest vector problem. In: SODA, pp. 1468\u20131480 (2010)","DOI":"10.1137\/1.9781611973075.119"},{"key":"6_CR33","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Walter, M.: Fast lattice point enumeration with minimal overhead. In: SODA, pp. 276\u2013294 (2015)","DOI":"10.1137\/1.9781611973730.21"},{"key":"6_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1007\/978-3-642-23178-0_40","volume-title":"Parallel Computing Technologies","author":"B Milde","year":"2011","unstructured":"Milde, B., Schneider, M.: A parallel implementation of gausssieve for the shortest vector problem in lattices. In: Malyshkin, V. (ed.) PaCT 2011. LNCS, vol. 6873, pp. 452\u2013458. Springer, Heidelberg (2011)"},{"issue":"2","key":"6_CR35","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(2), 181\u2013207 (2008)","journal-title":"J. Math. Cryptol."},{"key":"6_CR36","unstructured":"Plantard, T., Schneider, M.: Ideal lattice challenge (2014). http:\/\/latticechallenge.org\/ideallattice-challenge\/"},{"issue":"1","key":"6_CR37","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/1089242.1089247","volume":"15","author":"ME Pohst","year":"1981","unstructured":"Pohst, M.E.: On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications. ACM SIGSAM Bull. 15(1), 37\u201344 (1981)","journal-title":"ACM SIGSAM Bull."},{"key":"6_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-642-45239-0_17","volume-title":"Cryptography and Coding","author":"J van de Pol","year":"2013","unstructured":"van de Pol, J., Smart, N.P.: Estimating key sizes for high dimensional lattice-based systems. In: Stam, M. (ed.) IMACC 2013. LNCS, vol. 8308, pp. 290\u2013303. Springer, Heidelberg (2013)"},{"key":"6_CR39","unstructured":"Pujol, X., Stehl\u00e9, D.: Solving the shortest lattice vector problem in time $$2^{2.465n}$$. Cryptology ePrint Archive, Report 2009\/605 (2009)"},{"key":"6_CR40","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"},{"key":"6_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-642-19094-0_11","volume-title":"WALCOM: Algorithms and Computation","author":"M Schneider","year":"2011","unstructured":"Schneider, M.: Analysis of gauss-sieve for solving the shortest vector problem in lattices. In: Katoh, N., Kumar, A. (eds.) WALCOM 2011. LNCS, vol. 6552, pp. 89\u201397. Springer, Heidelberg (2011)"},{"key":"6_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-642-38553-7_22","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2013","author":"M Schneider","year":"2013","unstructured":"Schneider, M.: Sieving for shortest vectors in ideal lattices. In: Youssef, A., Nitaj, A., Hassanien, A.E. (eds.) AFRICACRYPT 2013. LNCS, vol. 7918, pp. 375\u2013391. Springer, Heidelberg (2013)"},{"key":"6_CR43","unstructured":"Schneider, M., Gama, N., Baumann, P., Nobach, L.: SVP challenge (2015). http:\/\/latticechallenge.org\/svp-challenge"},{"issue":"2","key":"6_CR44","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), 201\u2013224 (1987)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"6_CR45","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), 181\u2013199 (1994)","journal-title":"Math. Program."},{"key":"6_CR46","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":"6_CR47","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)"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology -- LATINCRYPT 2015"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-22174-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T00:31:03Z","timestamp":1748565063000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-22174-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319221731","9783319221748"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-22174-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"15 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}