{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:14:43Z","timestamp":1725578083989},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642190933"},{"type":"electronic","value":"9783642190940"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19094-0_11","type":"book-chapter","created":{"date-parts":[[2011,2,10]],"date-time":"2011-02-10T06:21:40Z","timestamp":1297318900000},"page":"89-97","source":"Crossref","is-referenced-by-count":11,"title":["Analysis of Gauss-Sieve for Solving the Shortest Vector Problem in Lattices"],"prefix":"10.1007","author":[{"given":"Michael","family":"Schneider","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","first-page":"601","volume-title":"STOC 2001","author":"M. Ajtai","year":"2001","unstructured":"Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: STOC 2001, pp. 601\u2013610. ACM, New York (2001)"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Buchmann, J., Lindner, R., R\u00fcckert, M., Schneider, M.: Explicit hard instances of the shortest vector problem (extended version). Cryptology ePrint Archive, Report 2008\/333 (2008), http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-540-88403-3_6"},{"issue":"18","key":"11_CR3","doi-asserted-by":"publisher","first-page":"1648","DOI":"10.1016\/j.tcs.2008.12.045","volume":"410","author":"J. Bl\u00f6mer","year":"2009","unstructured":"Bl\u00f6mer, J., Naewe, S.: Sampling methods for shortest vectors, closest vectors and successive minima. Theor. Comput. Sci.\u00a0410(18), 1648\u20131665 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR4","unstructured":"Cad\u00e9, D., Pujol, X., Stehl\u00e9, D.: fpLLL - a floating point LLL implementation. Available at Damien Stehl\u00e9\u2019s homepage at \u00e9cole normale sup\u00e9rieure de Lyon, http:\/\/perso.ens-lyon.fr\/damien.stehle\/english.html"},{"key":"11_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":"11_CR6","doi-asserted-by":"crossref","unstructured":"Goldstein, D., Mayer, A.: On the equidistribution of Hecke points. In: Forum Mathematicum 2003, vol.\u00a015(2), pp. 165\u2013189 (2003)","DOI":"10.1515\/form.2003.009"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-78967-3_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"N. Gama","year":"2008","unstructured":"Gama, N., Nguyen, P.Q.: Predicting lattice reduction. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 31\u201351. Springer, Heidelberg (2008)"},{"key":"11_CR8","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":"11_CR9","unstructured":"Gama, N., Schneider, M.: SVP Challenge (2010), http:\/\/www.latticechallenge.org\/svp-challenge"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-540-74143-5_10","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"G. Hanrot","year":"2007","unstructured":"Hanrot, G., Stehl\u00e9, D.: Improved analysis of Kannan\u2019s shortest lattice vector algorithm. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 170\u2013186. Springer, Heidelberg (2007)"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","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":"J. Hermans","year":"2010","unstructured":"Hermans, J., Schneider, M., Buchmann, J., Vercauteren, F., Preneel, B.: Parallel shortest lattice vector enumeration on graphics cards. In: Bernstein, D.J., Lange, T. (eds.) AFRICACRYPT 2010. LNCS, vol.\u00a06055, pp. 52\u201368. Springer, Heidelberg (2010)"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"4","author":"A. Lenstra","year":"1982","unstructured":"Lenstra, A., Lenstra, H., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Mathematische Annalen\u00a04, 515\u2013534 (1982)","journal-title":"Mathematische Annalen"},{"key":"11_CR13","first-page":"351","volume-title":"STOC","author":"D. Micciancio","year":"2010","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. ACM, New York (2010)"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Voulgaris, P.: Faster exponential time algorithms for the shortest vector problem. In: SODA, pp. 1468\u20131480. ACM\/SIAM (2010)","DOI":"10.1137\/1.9781611973075.119"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/11792086_18","volume-title":"Algorithmic Number Theory","author":"P.Q. Nguy\u00ean","year":"2006","unstructured":"Nguy\u00ean, P.Q., Stehl\u00e9, D.: LLL on the average. In: Hess, F., Pauli, S., Pohst, M. (eds.) ANTS 2006. LNCS, vol.\u00a04076, pp. 238\u2013256. Springer, Heidelberg (2006)"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Nguyen, P.Q., Vidick, T.: Sieve algorithms for the shortest vector problem are practical. J. of Mathematical Cryptology\u00a02(2) (2008)","DOI":"10.1515\/JMC.2008.009"},{"key":"11_CR17","unstructured":"Pujol, X., Stehle, D.: Solving the shortest lattice vector problem in time 22.465n. Cryptology ePrint Archive, Report 2009\/605 (2009), http:\/\/eprint.iacr.org\/"},{"key":"11_CR18","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.\u00a053, 201\u2013224 (1987)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR19","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. Mathematical Programming\u00a066, 181\u2013199 (1994)","journal-title":"Mathematical Programming"},{"key":"11_CR20","unstructured":"Voulgaris, P.: Gauss Sieve beta 0.1, Available at Panagiotis Voulgaris\u2019 homepage at the University of California, San Diego (2010), http:\/\/cseweb.ucsd.edu\/~pvoulgar\/impl.html"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19094-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T12:47:56Z","timestamp":1559998076000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19094-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642190933","9783642190940"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19094-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}