{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T07:53:52Z","timestamp":1776844432055,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642152900","type":"print"},{"value":"9783642152917","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"vor","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":[[2010]]},"DOI":"10.1007\/978-3-642-15291-7_21","type":"book-chapter","created":{"date-parts":[[2010,8,30]],"date-time":"2010-08-30T15:56:39Z","timestamp":1283183799000},"page":"211-222","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Parallel Enumeration of Shortest Lattice Vectors"],"prefix":"10.1007","author":[{"given":"\u00d6zg\u00fcr","family":"Dagdelen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Schneider","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_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":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1007\/978-3-642-03869-3_88","volume-title":"Euro-Par 2009 Parallel Processing","author":"W. Backes","year":"2009","unstructured":"Backes, W., Wetzel, S.: Parallel lattice basis reduction using a multi-threaded Schnorr-Euchner LLL algorithm. In: Sips, H., Epema, D., Lin, H.-X. (eds.) Euro-Par 2009 Parallel Processing. LNCS, vol.\u00a05704, pp. 960\u2013973. Springer, Heidelberg (2009)"},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/3-540-12868-9_103","volume-title":"Computer Algebra","author":"U. Fincke","year":"1983","unstructured":"Fincke, U., Pohst, M.: A procedure for determining algebraic integers of given norm. In: van Hulzen, J.A. (ed.) ISSAC 1983 and EUROCAL 1983. LNCS, vol.\u00a0162, pp. 194\u2013202. Springer, Heidelberg (1983)"},{"key":"21_CR4","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":"21_CR5","doi-asserted-by":"crossref","unstructured":"Gama, N., Nguyen, P.Q., Regev, O.: Lattice enumeration using extreme pruning, To appear in Eurocrypt 2010 (2010)","DOI":"10.1007\/978-3-642-13190-5_13"},{"issue":"2","key":"21_CR6","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 2003\u00a015(2), 165\u2013189 (2003)","journal-title":"Forum Mathematicum 2003"},{"key":"21_CR7","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":"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":"21_CR8","first-page":"193","volume-title":"STOC 1983","author":"R. Kannan","year":"1983","unstructured":"Kannan, R.: Improved algorithms for integer programming and related lattice problems. In: STOC 1983, pp. 193\u2013206. ACM, New York (1983)"},{"key":"21_CR9","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":"21_CR10","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Voulgaris, P.: Faster exponential time algorithms for the shortest vector problem. In: SODA 2010 (2010)","DOI":"10.1137\/1.9781611973075.119"},{"key":"21_CR11","unstructured":"Pujol, X.: Recherche efficace de vecteur court dans un r\u00e9seau euclidien. Masters thesis, ENS Lyon (2008)"},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/978-3-540-89255-7_24","volume-title":"Advances in Cryptology - ASIACRYPT 2008","author":"X. Pujol","year":"2008","unstructured":"Pujol, X., Stehl\u00e9, D.: Rigorous and efficient short lattice vectors enumeration. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol.\u00a05350, pp. 390\u2013405. Springer, Heidelberg (2008)"},{"key":"21_CR13","unstructured":"Pujol, X., Stehl\u00e9, D.: Accelerating lattice reduction with FPGAs, To appear in Latincrypt 2010 (2010)"},{"key":"21_CR14","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":"21_CR15","first-page":"269","volume-title":"ISSAC 1992","author":"G. Villard","year":"1992","unstructured":"Villard, G.: Parallel lattice basis reduction. In: ISSAC 1992, pp. 269\u2013277. ACM, New York (1992)"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2010 - Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15291-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T14:26:28Z","timestamp":1589898388000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15291-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642152900","9783642152917"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15291-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}