{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,5]],"date-time":"2026-11-05T20:07:53Z","timestamp":1793909273342,"version":"4.8.0"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319162942","type":"print"},{"value":"9783319162959","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-16295-9_16","type":"book-chapter","created":{"date-parts":[[2015,3,29]],"date-time":"2015-03-29T07:06:51Z","timestamp":1427612811000},"page":"288-305","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Tuning GaussSieve for Speed"],"prefix":"10.1007","author":[{"given":"Robert","family":"Fitzpatrick","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christian","family":"Bischof","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Johannes","family":"Buchmann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"\u00d6zg\u00fcr","family":"Dagdelen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Florian","family":"G\u00f6pfert","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Artur","family":"Mariano","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bo-Yin","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,3,29]]},"reference":[{"key":"16_CR1","unstructured":"Voulgaris, P.: GaussSieve Implementation. (http:\/\/cseweb.ucsd.edu\/pvoulgar\/impl.html)"},{"key":"16_CR2","unstructured":"TU Darmstadt Lattice Challenge. (http:\/\/www.latticechallenge.org)"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: The shortest vector problem in L2 is NP-hard for randomized reductions (Extended Abstract). In: STOC 1998, pp. 10\u201319. ACM, New York (1998)","DOI":"10.1145\/276698.276705"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: Vitter, J.S., Spirakis, P.G., Yannakakis, M. (eds.) STOC, pp. 601\u2013610. ACM (2001)","DOI":"10.1145\/380752.380857"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Chen, Y., Nguyen, P.Q.: BKZ 2.0: Better lattice security estimates. In: ASIACRYPT, pp. 1\u201320 (2011)","DOI":"10.1007\/978-3-642-25385-0_1"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Gama, N., Nguyen, P.Q.: Predicting lattice reduction. In: EUROCRYPT, pp. 31\u201351 (2008)","DOI":"10.1007\/978-3-540-78967-3_3"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Gama, N., Nguyen, P.Q., Regev, O.: Lattice enumeration using extreme pruning. In: EUROCRYPT, pp. 257\u2013278 (2010)","DOI":"10.1007\/978-3-642-13190-5_13"},{"key":"16_CR8","unstructured":"Gama, N., Schneider, M.: SVP Challenge (2010). (http:\/\/www.latticechallenge.org\/svp-challenge)"},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1515\/form.2003.009","volume":"15","author":"D Goldstein","year":"2003","unstructured":"Goldstein, D., Mayer, A.: On the equidistribution of hecke points. Forum Mathematicum 15, 165\u2013190 (2003)","journal-title":"Forum Mathematicum"},{"key":"16_CR10","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: Public Key Cryptography, pp. 411\u2013428 (2014)","DOI":"10.1007\/978-3-642-54631-0_24"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Kannan, R.: Improved algorithms for integer programming and related lattice problems. In: Johnson, D.S., Fagin, R., Fredman, M.L., Harel, D., Karp, R.M., Lynch, N.A., Papadimitriou, C.H., Rivest, R.L., Ruzzo, W.L., Seiferas, J.I. (eds.) STOC, pp. 193\u2013206. ACM (1983)","DOI":"10.1145\/800061.808749"},{"key":"16_CR12","unstructured":"Klein, P.N.: Finding the closest lattice vector when it\u2019s unusually close. In: SODA, pp. 937\u2013941 (2000)"},{"key":"16_CR13","doi-asserted-by":"crossref","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 - How many dollars you need to break SVP challenges. In: CHES, pp. 176\u2013191 (2011)","DOI":"10.1007\/978-3-642-23951-9_12"},{"issue":"4","key":"16_CR14","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Mathematische Annalen 261(4), 515\u2013534 (1982)","journal-title":"Mathematische Annalen"},{"key":"16_CR15","volume-title":"Tests of Univariate and Multivariate Normality. Handbook of Statistics","year":"1980","unstructured":"Mardia, K.V. (ed.): Tests of Univariate and Multivariate Normality. Handbook of Statistics. North-Holland, Amsterdam (1980)"},{"key":"16_CR16","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 (2014)","DOI":"10.1109\/SBAC-PAD.2014.18"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Mariano, A., Dagdelen, O., Bischof, C.: A comprehensive empirical comparison of parallel ListSieve and GaussSieve. APCI&E (2014)","DOI":"10.1007\/978-3-319-14325-5_5"},{"key":"16_CR18","series-title":"Milken Institute Series on Financial Innovation and Economic Growth","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0897-7","volume-title":"Complexity of Lattice Problems: A Cryptographic Perspective","author":"D Micciancio","year":"2002","unstructured":"Micciancio, D., Goldwasser, S.: Complexity of Lattice Problems: A Cryptographic Perspective. Milken Institute Series on Financial Innovation and Economic Growth. Springer, US (2002)"},{"key":"16_CR19","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. Society for Industrial and Applied Mathematics (2010)","DOI":"10.1137\/1.9781611973075.119"},{"key":"16_CR20","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":"16_CR21","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":"16_CR22","unstructured":"Schneider, M.: Sieving for shortest vectors in ideal lattices. IACR Cryptology ePrint Archive 2011, 458 (2011)"},{"key":"16_CR23","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, 201\u2013224 (1987)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR24","doi-asserted-by":"crossref","unstructured":"Schnorr, C.-P.: Lattice reduction by random sampling and birthday methods. In: STACS, pp. 145\u2013156 (2003)","DOI":"10.1007\/3-540-36494-3_14"},{"issue":"2","key":"16_CR25","doi-asserted-by":"publisher","first-page":"340","DOI":"10.2307\/1969027","volume":"46","author":"CL Siegel","year":"1945","unstructured":"Siegel, C.L.: A mean value theorem in geometry of numbers. Ann. Math. 46(2), 340\u2013347 (1945)","journal-title":"Ann. Math."},{"key":"16_CR26","first-page":"71","volume-title":"The LLL Algorithm, Information Security and Cryptography","author":"B Vall\u00e9e","year":"2010","unstructured":"Vall\u00e9e, B., Vera, A.: Probabilistic analyses of lattice reduction algorithms. In: Nguyen, P.Q., Vall\u00e9e, B. (eds.) The LLL Algorithm, Information Security and Cryptography, pp. 71\u2013143. Springer, Heidelberg (2010)"},{"key":"16_CR27","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":"16_CR28","doi-asserted-by":"crossref","unstructured":"Zhang, F., Pan, Y., Hu, G.: A Three-level sieve algorithm for the shortest vector problem. In: Selected Areas in Cryptography, pp. 29\u201347 (2013)","DOI":"10.1007\/978-3-662-43414-7_2"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology - LATINCRYPT 2014"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-16295-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T23:54:39Z","timestamp":1676937279000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-16295-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319162942","9783319162959"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-16295-9_16","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":"29 March 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}