{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T14:57:35Z","timestamp":1773154655276,"version":"3.50.1"},"publisher-location":"Cham","reference-count":45,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319790626","type":"print"},{"value":"9783319790633","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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-79063-3_14","type":"book-chapter","created":{"date-parts":[[2018,3,31]],"date-time":"2018-03-31T14:23:38Z","timestamp":1522506218000},"page":"292-311","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":37,"title":["Progressive Lattice Sieving"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2369-9067","authenticated-orcid":false,"given":"Thijs","family":"Laarhoven","sequence":"first","affiliation":[]},{"given":"Artur","family":"Mariano","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,4,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":"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_CR3","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_CR4","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_CR5","doi-asserted-by":"crossref","unstructured":"Bos, J., Ducas, L., Kiltz, E., Lepoint, T., Lyubashevsky, V., Schanck, J.M., Schwabe, P., Stehl\u00e9, D.: CRYSTALS - Kyber: a CCA-secure module-lattice-based KEM. In: EuroS&P (2018)","DOI":"10.1109\/EuroSP.2018.00032"},{"key":"14_CR6","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_CR7","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, pp. 1\u201314 (2015)"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-31517-1_1","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2016","author":"A Becker","year":"2016","unstructured":"Becker, A., Laarhoven, T.: Efficient (Ideal) lattice sieving using cross-polytope LSH. In: Pointcheval, D., Nitaj, A., Rachidi, T. (eds.) AFRICACRYPT 2016. LNCS, vol. 9646, pp. 3\u201323. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-31517-1_1"},{"key":"14_CR9","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_CR10","first-page":"1","volume":"3","author":"JW Bos","year":"2016","unstructured":"Bos, J.W., Naehrig, M., van de Pol, J.: Sieving for shortest vectors in ideal lattices: a practical perspective. Int. J. Appl. Cryptogr. 3, 1\u201323 (2016)","journal-title":"Int. J. Appl. Cryptogr."},{"key":"14_CR11","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"},{"key":"14_CR12","unstructured":"Ducas, L., Lepoint, T., Lyubashevsky, V., Schwabe, P., Seiler, G., Stehl\u00e9, D.: CRYSTALS - dilithium: digital signatures from module lattices. In: CHES (2018)"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Ducas, L.: Shortest vector from lattice sieving: a few dimensions for free. In: EUROCRYPT (2018)","DOI":"10.1007\/978-3-319-78381-9_5"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-16295-9_16"},{"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."},{"key":"14_CR16","unstructured":"The FPLLL Development Team. FPLLL, a lattice reduction library (2016). https:\/\/github.com\/fplll\/fplll"},{"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","doi-asserted-by":"crossref","unstructured":"Herold, G., Kirshanova, E., Laarhoven, T.: Speed-ups and time-memory trade-offs for tuple lattice sieving. In: PKC (2018)","DOI":"10.1007\/978-3-319-76578-5_14"},{"key":"14_CR20","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). https:\/\/doi.org\/10.1007\/978-3-642-20901-7_10"},{"key":"14_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/978-3-642-54631-0_24","volume-title":"Public-Key Cryptography \u2013 PKC 2014","author":"T Ishiguro","year":"2014","unstructured":"Ishiguro, T., Kiyomoto, S., Miyake, Y., Takagi, T.: Parallel gauss sieve algorithm: solving the SVP challenge over a 128-dimensional ideal lattice. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol. 8383, pp. 411\u2013428. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54631-0_24"},{"key":"14_CR22","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_CR23","unstructured":"Klein, P.: Finding the closest lattice vector when it\u2019s unusually close. In: SODA, pp. 937\u2013941 (2000)"},{"key":"14_CR24","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_CR25","unstructured":"Laarhoven, T.: Finding closest lattice vectors using approximate Voronoi cells. Cryptology ePrint Archive, Report 2016\/888 (2016)"},{"key":"14_CR26","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"},{"key":"14_CR27","doi-asserted-by":"crossref","unstructured":"Mariano, A., Bischof, C.: Enhancing the scalability and memory usage of HashSieve on multi-core CPUs. In: PDP, pp. 545\u2013552 (2016)","DOI":"10.1109\/PDP.2016.31"},{"key":"14_CR28","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_CR29","doi-asserted-by":"crossref","unstructured":"Mariano, A., Laarhoven, T., Bischof, C.: A parallel variant of LDSieve for the SVP on lattices. In: PDP (2017)","DOI":"10.1109\/PDP.2017.60"},{"key":"14_CR30","doi-asserted-by":"publisher","first-page":"24184","DOI":"10.1109\/ACCESS.2017.2748179","volume":"5","author":"A Mariano","year":"2017","unstructured":"Mariano, A., Laarhoven, T., Correia, F., Rodrigues, M., Falcao, G.: A practical view of the state-of-the-art of lattice-based cryptanalysis. IEEE Access 5, 24184\u201324202 (2017)","journal-title":"IEEE Access"},{"key":"14_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. LNCS, vol. 8805, pp. 48\u201359. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-14325-5_5"},{"key":"14_CR32","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). https:\/\/doi.org\/10.1007\/978-3-642-23178-0_40"},{"key":"14_CR33","doi-asserted-by":"crossref","unstructured":"Mariano, A., Timnat, S., Bischof, C.: Lock-free Gauss-Sieve for linear speedups in parallel high performance SVP calculation. In: SBAC-PAD, pp. 278\u2013285 (2014)","DOI":"10.1109\/SBAC-PAD.2014.18"},{"key":"14_CR34","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":"14_CR35","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"},{"issue":"2","key":"14_CR36","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1515\/JMC.2008.009","volume":"2","author":"PQ Nguy\u00ean","year":"2008","unstructured":"Nguy\u00ean, 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."},{"issue":"2\u20133","key":"14_CR37","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. Theoret. Comput. Sci. 53(2\u20133), 201\u2013224 (1987)","journal-title":"Theoret. Comput. Sci."},{"key":"14_CR38","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). https:\/\/doi.org\/10.1007\/978-3-642-19094-0_11"},{"key":"14_CR39","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). https:\/\/doi.org\/10.1007\/978-3-642-38553-7_22"},{"issue":"2\u20133","key":"14_CR40","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."},{"issue":"2","key":"14_CR41","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1137\/060676362","volume":"23","author":"N Sommer","year":"2009","unstructured":"Sommer, N., Feder, M., Shalvi, O.: Finding the closest lattice point by iterative slicing. SIAM J. Discret. Math. 23(2), 715\u2013731 (2009)","journal-title":"SIAM J. Discret. Math."},{"key":"14_CR42","unstructured":"SVP Challenge (2018). https:\/\/latticechallenge.org\/svp-challenge\/"},{"key":"14_CR43","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_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-319-52153-4_3","volume-title":"Topics in Cryptology \u2013 CT-RSA 2017","author":"S-Y Yang","year":"2017","unstructured":"Yang, S.-Y., Kuo, P.-C., Yang, B.-Y., Cheng, C.-M.: Gauss sieve algorithm on GPUs. In: Handschuh, H. (ed.) CT-RSA 2017. LNCS, vol. 10159, pp. 39\u201357. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-52153-4_3"},{"key":"14_CR45","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","Post-Quantum Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-79063-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T14:31:46Z","timestamp":1710340306000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-79063-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319790626","9783319790633"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-79063-3_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 April 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PQCrypto","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Post-Quantum Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Fort Lauderdale","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"9 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pqcrypto2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.math.fau.edu\/pqcrypto2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}