{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T04:19:29Z","timestamp":1775794769664,"version":"3.50.1"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319143248","type":"print"},{"value":"9783319143255","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-319-14325-5_5","type":"book-chapter","created":{"date-parts":[[2014,12,10]],"date-time":"2014-12-10T08:55:04Z","timestamp":1418201704000},"page":"48-59","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["A Comprehensive Empirical Comparison of Parallel ListSieve and GaussSieve"],"prefix":"10.1007","author":[{"given":"Artur","family":"Mariano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00d6zg\u00fcr","family":"Dagdelen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Bischof","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: STOC 1996, pp. 99\u2013108. ACM (1996)","DOI":"10.1145\/237814.237838"},{"key":"5_CR2","first-page":"10","volume-title":"STOC 1998","author":"M. Ajtai","year":"1998","unstructured":"Ajtai, M.: The Shortest Vector Problem in L2 is NP-hard for Randomized Reductions (Extended Abstract). In: STOC 1998, pp. 10\u201319. ACM, NY (1998)"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Fitzpatrick, R., et al.: Tuning GaussSieve for Speed. In: LATINCRYPT 2014, Florian\u00f3polis, Brazil (September 2014)","DOI":"10.1007\/978-3-319-16295-9_16"},{"key":"5_CR4","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, Part II. LNCS, vol.\u00a06272, pp. 211\u2013222. Springer, Heidelberg (2010)"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-642-14712-8_8","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2010","author":"J. Detrey","year":"2010","unstructured":"Detrey, J., Hanrot, G., Pujol, X., Stehl\u00e9, D.: Accelerating Lattice Reduction with FPGAs. In: Abdalla, M., Barreto, P.S.L.M. (eds.) LATINCRYPT 2010. LNCS, vol.\u00a06212, pp. 124\u2013143. Springer, Heidelberg (2010)"},{"key":"5_CR6","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.\u00a06110, pp. 257\u2013278. Springer, Heidelberg (2010)"},{"key":"5_CR7","unstructured":"Klein, P.: Finding the closest lattice vector when it\u2019s unusually close. In: SODA 2000, pp. 937\u2013941 (2000)"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-642-23951-9_12","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2011","author":"P.-C. Kuo","year":"2011","unstructured":"Kuo, P.-C., Schneider, M., Dagdelen, \u00d6., Reichelt, J., Buchmann, J., Cheng, C.-M., Yang, B.-Y.: Extreme Enumeration on GPU and in Clouds. In: Preneel, B., Takagi, T. (eds.) CHES 2011. LNCS, vol.\u00a06917, pp. 176\u2013191. Springer, Heidelberg (2011)"},{"issue":"4","key":"5_CR9","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A. Lenstra","year":"1982","unstructured":"Lenstra, A., et al.: Factoring polynomials with rational coefficients. Mathematische Annalen\u00a0261(4), 515\u2013534 (1982)","journal-title":"Mathematische Annalen"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Mariano, A., et al.: Lock-free GaussSieve for Linear Speedups in Parallel High Performance SVP Calculation. In: SBAC-PAD 2014, Paris, France (2014)","DOI":"10.1109\/SBAC-PAD.2014.18"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Voulgaris, P.: Faster exponential time algorithms for the shortest vector problem. In: SODA 2010, PA, USA, pp. 1468\u20131480 (2010)","DOI":"10.1137\/1.9781611973075.119"},{"key":"5_CR12","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.\u00a06873, pp. 452\u2013458. Springer, Heidelberg (2011)"},{"key":"5_CR13","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.\u00a06552, pp. 89\u201397. Springer, Heidelberg (2011)"},{"issue":"1-3","key":"5_CR14","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01581144","volume":"66","author":"C. Schnorr","year":"1994","unstructured":"Schnorr, C., Euchner, M.: Lattice basis reduction: Improved practical algorithms and solving subset sum problems. Math. Programming\u00a066(1-3), 181\u2013199 (1994)","journal-title":"Math. Programming"},{"issue":"5","key":"5_CR15","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P.W. Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput.\u00a026(5), 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2014: Parallel Processing Workshops"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-14325-5_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:31:05Z","timestamp":1587342665000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-14325-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319143248","9783319143255"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14325-5_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}