{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T14:56:55Z","timestamp":1773154615783,"version":"3.50.1"},"publisher-location":"Cham","reference-count":80,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030255091","type":"print"},{"value":"9783030255107","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-25510-7_1","type":"book-chapter","created":{"date-parts":[[2019,7,13]],"date-time":"2019-07-13T07:02:33Z","timestamp":1563001353000},"page":"3-22","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["Finding Closest Lattice Vectors Using Approximate Voronoi Cells"],"prefix":"10.1007","author":[{"given":"Emmanouil","family":"Doulgerakis","sequence":"first","affiliation":[]},{"given":"Thijs","family":"Laarhoven","sequence":"additional","affiliation":[]},{"given":"Benne","family":"de Weger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,14]]},"reference":[{"key":"1_CR1","unstructured":"SVP challenge (2018). \n                      http:\/\/latticechallenge.org\/svp-challenge\/"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Aggarwal, D., Dadush, D., Regev, O., Stephens-Davidowitz, N.: Solving the shortest vector problem in \n                      \n                        \n                      \n                      $$2^n$$\n                     time via discrete Gaussian sampling. In: STOC, pp. 733\u2013742 (2015)","DOI":"10.1145\/2746539.2746606"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Aggarwal, D., Dadush, D., Stephens-Davidowitz, N.: Solving the closest vector problem in \n                      \n                        \n                      \n                      $$2^n$$\n                     time - the discrete Gaussian strikes again! In: FOCS, pp. 563\u2013582 (2015)","DOI":"10.1145\/2746539.2746606"},{"issue":"8","key":"1_CR4","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 Transact. Inf. Theor. 48(8), 2201\u20132214 (2002)","journal-title":"IEEE Transact. Inf. Theor."},{"key":"1_CR5","unstructured":"Aharonov, D., Regev, O.: Lattice problems in \n                      \n                        \n                      \n                      $${\\sf NP} \\cap {\\sf coNP}$$\n                    . In: FOCS, pp. 362\u2013371 (2004)"},{"key":"1_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":"1_CR7","doi-asserted-by":"crossref","unstructured":"Albrecht, M., Ducas, L., Herold, G., Kirshanova, E., Postlethwaite, E., Stevens, M.: The general sieve kernel and new records in lattice reduction. Preprint, 2018","DOI":"10.1007\/978-3-030-17656-3_25"},{"key":"1_CR8","unstructured":"Alekhnovich, M., Khot, S., Kindler, G., Vishnoi, N.: Hardness of approximating the closest vector problem with pre-processing. In: FOCS, pp. 216\u2013225 (2005)"},{"key":"1_CR9","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":"1_CR10","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":"1_CR11","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":"1_CR12","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":"1_CR13","doi-asserted-by":"crossref","unstructured":"Andoni, A., Razenshteyn, I.: Optimal data-dependent hashing for approximate near neighbors. In: STOC, pp. 793\u2013801 (2015)","DOI":"10.1145\/2746539.2746553"},{"key":"1_CR14","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). \n                      https:\/\/doi.org\/10.1007\/978-3-319-56614-6_3"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-030-03326-2_14","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"Y Aono","year":"2018","unstructured":"Aono, Y., Nguyen, P.Q., Shen, Y.: Quantum lattice enumeration and tweaking discrete pruning. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11272, pp. 405\u2013434. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-030-03326-2_14"},{"issue":"1","key":"1_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579403","volume":"6","author":"L Babai","year":"1986","unstructured":"Babai, L.: On Lovasz lattice reduction and the nearest lattice point problem. Combinatorica 6(1), 1\u201313 (1986)","journal-title":"Combinatorica"},{"key":"1_CR17","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":"1_CR18","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"},{"issue":"A","key":"1_CR19","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1112\/S1461157014000229","volume":"17","author":"Anja Becker","year":"2014","unstructured":"Becker, A., Gama, N., Joux, A.: A sieve algorithm based on overlattices. In: ANTS, pp. 49\u201370 (2014)","journal-title":"LMS Journal of Computation and Mathematics"},{"key":"1_CR20","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":"1_CR21","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":"Anja Becker","year":"2016","unstructured":"Becker, A., Laarhoven, T.: Efficient (ideal) lattice sieving using cross-polytope LSH. In: AFRICACRYPT, pp. 3\u201323 (2016)"},{"key":"1_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88702-7","volume-title":"Post-quantum Cryptography","year":"2009","unstructured":"Bernstein, D.J., Buchmann, J., Dahmen, E. (eds.): Post-quantum Cryptography. Springer, Heidelberg (2009). \n                      https:\/\/doi.org\/10.1007\/978-3-540-88702-7"},{"key":"1_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-319-72565-9_12","volume-title":"Selected Areas in Cryptography \u2013 SAC 2017","author":"DJ Bernstein","year":"2018","unstructured":"Bernstein, D.J., Chuengsatiansup, C., Lange, T., van Vredendaal, C.: NTRU prime: reducing attack surface at low cost. In: Adams, C., Camenisch, J. (eds.) SAC 2017. LNCS, vol. 10719, pp. 235\u2013260. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-72565-9_12"},{"key":"1_CR24","unstructured":"Bhattacharya, S., et al.: Round5: Compact and fast post-quantum public-key encryption. Cryptology ePrint Archive, Report 2018\/725 (2018)"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Bonifas, N., Dadush, D.: Short paths on the Voronoi graph and the closest vector problem with preprocessing. In: SODA, pp. 295\u2013314 (2015)","DOI":"10.1137\/1.9781611973730.22"},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Bos, J., et al.: Frodo: Take off the ring! practical, quantum-secure key exchange from LWE. In: CCS, pp. 1006\u20131018 (2016)","DOI":"10.1145\/2976749.2978425"},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Bos, J., et al.: CRYSTALS - Kyber: a CCA-secure module-lattice-based KEM. In: Euro S&P, pp. 353\u2013367 (2018)","DOI":"10.1109\/EuroSP.2018.00032"},{"issue":"4","key":"1_CR28","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1504\/IJACT.2017.089353","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. Crypt. 3(4), 313\u2013329 (2016)","journal-title":"Int. J. Appl. Crypt."},{"key":"1_CR29","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":"1_CR30","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":"1_CR31","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-6568-7","volume-title":"Sphere Packings, Lattices and Groups","author":"JH Conway","year":"1999","unstructured":"Conway, J.H., Sloane, N.J.A.: Sphere Packings, Lattices and Groups. Springer, Heidelberg (1999). \n                      https:\/\/doi.org\/10.1007\/978-1-4757-6568-7"},{"key":"1_CR32","doi-asserted-by":"crossref","unstructured":"Correia, F., Mariano, A., Proenca, A., Bischof, C., Agrell, E.: Parallel improved Schnorr-Euchner enumeration SE++ for the CVP and SVP. In: PDP, pp. 596\u2013603 (2016)","DOI":"10.1109\/PDP.2016.95"},{"key":"1_CR33","doi-asserted-by":"crossref","unstructured":"Dadush, D., Regev, O., Stephens-Davidowitz, N.: On the closest vector problem with a distance guarantee. In: CCC, pp. 98\u2013109 (2014)","DOI":"10.1109\/CCC.2014.18"},{"key":"1_CR34","unstructured":"The FPLLL development team. FPLLL, a lattice reduction library (2016). \n                      https:\/\/github.com\/fplll\/fplll"},{"key":"1_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-319-78381-9_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"L Ducas","year":"2018","unstructured":"Ducas, L.: Shortest vector from lattice sieving: a few dimensions for free. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10820, pp. 125\u2013145. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-78381-9_5"},{"key":"1_CR36","first-page":"238","volume":"2018","author":"L Ducas","year":"2018","unstructured":"Ducas, L., Lepoint, T., Lyubashevsky, V., Schwabe, P., Seiler, G., Stehl\u00e9, D.: CRYSTALS - Dilithium: Digital signatures from module lattices. CHES 2018, 238\u2013268 (2018)","journal-title":"CHES"},{"key":"1_CR37","unstructured":"Feige, U., Micciancio, D.: The inapproximability of lattice and coding problems with preprocessing. In: CCC, pp. 32\u201340 (2002)"},{"issue":"170","key":"1_CR38","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":"1_CR39","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., et al.: Tuning gausssieve for speed. In: Aranha, D.F., Menezes, A. (eds.) LATINCRYPT 2014. LNCS, vol. 8895, pp. 288\u2013305. Springer, Cham (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-319-16295-9_16"},{"key":"1_CR40","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). \n                      https:\/\/doi.org\/10.1007\/978-3-642-13190-5_13"},{"key":"1_CR41","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: STOC, pp. 197\u2013206 (2008)","DOI":"10.1145\/1374376.1374407"},{"key":"1_CR42","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-642-12678-9_4","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2010","author":"Jens Hermans","year":"2010","unstructured":"Hermans, J., Schneider, M., Buchmann, J., Vercauteren, F., Preneel, B.: Parallel shortest lattice vector enumeration on graphics cards. In: AFRICACRYPT, pp. 52\u201368 (2010)"},{"key":"1_CR43","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). \n                      https:\/\/doi.org\/10.1007\/978-3-662-54365-8_2"},{"key":"1_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-319-76578-5_14","volume-title":"Public-Key Cryptography \u2013 PKC 2018","author":"G Herold","year":"2018","unstructured":"Herold, G., Kirshanova, E., Laarhoven, T.: Speed-ups and time\u2013memory trade-offs for tuple lattice sieving. In: Abdalla, M., Dahab, R. (eds.) PKC 2018. LNCS, vol. 10769, pp. 407\u2013436. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-76578-5_14"},{"key":"1_CR45","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":"1_CR46","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). \n                      https:\/\/doi.org\/10.1007\/978-3-642-54631-0_24"},{"key":"1_CR47","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":"1_CR48","unstructured":"Kirchner, P., Fouque, P.-A.: Time-memory trade-off for lattice enumeration in a ball. Cryptology ePrint Archive, Report 2016\/222 (2016)"},{"key":"1_CR49","unstructured":"Klein, P.: Finding the closest lattice vector when it\u2019s unusually close. In: SODA, pp. 937\u2013941 (2000)"},{"key":"1_CR50","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). \n                      https:\/\/doi.org\/10.1007\/978-3-662-47989-6_1"},{"key":"1_CR51","unstructured":"Laarhoven, T.: Tradeoffs for nearest neighbors on the sphere. \n                      arXiv:1511.07527\n                      \n                     [cs.DS], pp. 1\u201316 (2015)"},{"key":"1_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-3-319-69453-5_28","volume-title":"Selected Areas in Cryptography \u2013 SAC 2016","author":"T Laarhoven","year":"2017","unstructured":"Laarhoven, T.: Sieving for closest lattice vectors (with preprocessing). In: Avanzi, R., Heys, H. (eds.) SAC 2016. LNCS, vol. 10532, pp. 523\u2013542. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-69453-5_28"},{"key":"1_CR53","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). \n                      https:\/\/doi.org\/10.1007\/978-3-319-22174-8_6"},{"key":"1_CR54","doi-asserted-by":"crossref","unstructured":"Laarhoven, T., Mariano, A.: Progressive lattice sieving. In: PQCrypto, pp. 292\u2013311 (2018)","DOI":"10.1007\/978-3-319-79063-3_14"},{"issue":"2","key":"1_CR55","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."},{"issue":"4","key":"1_CR56","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/BF02128669","volume":"10","author":"JC Lagarias","year":"1990","unstructured":"Lagarias, J.C., Lenstra, H.W., Schnorr, C.-P.: Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice. Combinatorica 10(4), 333\u2013348 (1990)","journal-title":"Combinatorica"},{"key":"1_CR57","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":"1_CR58","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":"1_CR59","doi-asserted-by":"crossref","unstructured":"Mariano, A., Laarhoven, T., Bischof, C.: A parallel variant of LDSieve for the SVP on lattices. In: PDP, pp. 23\u201330 (2017)","DOI":"10.1109\/PDP.2017.60"},{"key":"1_CR60","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). \n                      https:\/\/doi.org\/10.1007\/978-3-319-14325-5_5"},{"key":"1_CR61","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"},{"issue":"3","key":"1_CR62","doi-asserted-by":"publisher","first-page":"1212","DOI":"10.1109\/18.915688","volume":"47","author":"D Micciancio","year":"2001","unstructured":"Micciancio, D.: The hardness of the closest vector problem with preprocessing. IEEE Transact. Inf. Theory 47(3), 1212\u20131215 (2001)","journal-title":"IEEE Transact. Inf. Theory"},{"key":"1_CR63","unstructured":"Micciancio, D.: Efficient reductions among lattice problems. In: SODA, pp. 84\u201393 (2008)"},{"key":"1_CR64","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":"1_CR65","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":"1_CR66","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":"1_CR67","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). \n                      https:\/\/doi.org\/10.1007\/978-3-642-23178-0_40"},{"issue":"2","key":"1_CR68","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."},{"key":"1_CR69","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-642-15291-7_21","volume-title":"Euro-Par 2010 - Parallel Processing","author":"\u00d6 Dagdelen","year":"2010","unstructured":"Dagdelen, \u00d6., Schneider, M.: Parallel enumeration of shortest lattice vectors. In: D\u2019Ambra, P., Guarracino, M., Talia, D. (eds.) Euro-Par 2010. LNCS, vol. 6272, pp. 211\u2013222. Springer, Heidelberg (2010). \n                      https:\/\/doi.org\/10.1007\/978-3-642-15291-7_21"},{"issue":"9","key":"1_CR70","doi-asserted-by":"publisher","first-page":"2031","DOI":"10.1109\/TIT.2004.833350","volume":"50","author":"O Regev","year":"2004","unstructured":"Regev, O.: Improved inapproximability of lattice and coding problems with preprocessing. IEEE Transact. Inf. Theory 50(9), 2031\u20132037 (2004)","journal-title":"IEEE Transact. Inf. Theory"},{"key":"1_CR71","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). \n                      https:\/\/doi.org\/10.1007\/978-3-642-19094-0_11"},{"key":"1_CR72","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). \n                      https:\/\/doi.org\/10.1007\/978-3-642-38553-7_22"},{"issue":"2","key":"1_CR73","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":"1_CR74","unstructured":"Stephens-Davidowitz, N.: Dimension-preserving reductions between lattice problems, pp. 1\u20136 (2016). \n                      http:\/\/noahsd.com\/latticeproblems.pdf"},{"key":"1_CR75","unstructured":"van de Pol, J.: Lattice-based cryptography. Master\u2019s thesis, Eindhoven University of Technology (2011)"},{"issue":"1","key":"1_CR76","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1109\/18.481786","volume":"42","author":"E Viterbo","year":"1996","unstructured":"Viterbo, E., Biglieri, E.: Computing the voronoi cell of a lattice: the diamond-cutting algorithm. IEEE Transact. Inf. Theory 42(1), 161\u2013171 (1996)","journal-title":"IEEE Transact. Inf. Theory"},{"key":"1_CR77","unstructured":"Wang, J., Shen, H.T., Song, J., Ji, J.: Hashing for similarity search: a survey. \n                      arXiv:1408.2927\n                      \n                     [cs.DS], pp. 1\u201329 (2014)"},{"key":"1_CR78","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":"1_CR79","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). \n                      https:\/\/doi.org\/10.1007\/978-3-319-52153-4_3"},{"key":"1_CR80","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-662-43414-7_2","volume-title":"Selected Areas in Cryptography -- SAC 2013","author":"Feng Zhang","year":"2014","unstructured":"Zhang, F., Pan, Y., Hu, G.: A three-level sieve algorithm for the shortest vector problem. In: SAC, pp. 29\u201347 (2013)"}],"container-title":["Lecture Notes in Computer Science","Post-Quantum Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-25510-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,13]],"date-time":"2019-07-13T07:02:47Z","timestamp":1563001367000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-25510-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030255091","9783030255107"],"references-count":80,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-25510-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 July 2019","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":"Chongquin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pqcrypto0","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"66","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3-5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3-5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}