{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T10:35:17Z","timestamp":1753439717659},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642239502"},{"type":"electronic","value":"9783642239519"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23951-9_12","type":"book-chapter","created":{"date-parts":[[2011,9,26]],"date-time":"2011-09-26T01:17:11Z","timestamp":1316999831000},"page":"176-191","source":"Crossref","is-referenced-by-count":23,"title":["Extreme Enumeration on GPU and in Clouds"],"prefix":"10.1007","author":[{"given":"Po-Chun","family":"Kuo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Schneider","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00d6zg\u00fcr","family":"Dagdelen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Reichelt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johannes","family":"Buchmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chen-Mou","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo-Yin","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1145\/380752.380857","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":"12_CR2","unstructured":"Dean, J., Ghemawat, S.: MapReduce: Simplified data processing on large clusters. In: OSDI 2004: Sixth Symposium on Operating System Design and Implementation, San Francisco, CA, USA (December 2004)"},{"key":"12_CR3","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":"12_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. LNCS, vol.\u00a06272, pp. 211\u2013222. Springer, Heidelberg (2010)"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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.: Michael Pohst. 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)"},{"issue":"2","key":"12_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\u00a015(2), 165\u2013189 (2003)","journal-title":"Forum Mathematicum"},{"key":"12_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":"12_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":"12_CR9","unstructured":"Gama, N., Schneider, M.: SVP Challenge (2010), \n                    \n                      http:\/\/www.latticechallenge.org\/svp-challenge"},{"key":"12_CR10","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":"12_CR11","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1145\/800061.808749","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":"12_CR12","volume-title":"Programming Massively Parallel Processors: A Hands-on Approach","author":"D.B. Kirk","year":"2010","unstructured":"Kirk, D.B., Hwu, W.-m.: Programming Massively Parallel Processors: A Hands-on Approach, 1st edn. Morgan Kaufmann, San Francisco (2010)","edition":"1"},{"key":"12_CR13","unstructured":"Kleinjung, T., Lenstra, A.K., Page, D., Smart, N.P.: Using the cloud to determine key strengths. Cryptology ePrint Archive, Report 2011\/254 (2011), \n                    \n                      http:\/\/eprint.iacr.org\/"},{"key":"12_CR14","volume-title":"Handbook of Information Security","author":"A. Lenstra","year":"2005","unstructured":"Lenstra, A.: Key lengths. In: Bidgoli, H. (ed.) Handbook of Information Security. Wiley, Chichester (2005)"},{"key":"12_CR15","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":"12_CR16","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":"12_CR17","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Voulgaris, P.: Faster exponential time algorithms for the shortest vector problem. In: SODA 2010, pp. 1468\u20131480. ACM\/SIAM (2010)","DOI":"10.1137\/1.9781611973075.119"},{"key":"12_CR18","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":"12_CR19","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":"12_CR20","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":"12_CR21","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Advances in Cryptology - EUROCRYPT \u201995","author":"C.-P. Schnorr","year":"1995","unstructured":"Schnorr, C.-P., H\u00f6rner, H.H.: Attacking the chor-rivest cryptosystem by improved lattice reduction. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol.\u00a0921, pp. 1\u201312. Springer, Heidelberg (1995)"},{"key":"12_CR22","unstructured":"Shoup, V.: Number theory library (NTL) for C++, version 5.5.2, \n                    \n                      http:\/\/www.shoup.net\/ntl\/"}],"container-title":["Lecture Notes in Computer Science","Cryptographic Hardware and Embedded Systems \u2013 CHES 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23951-9_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T08:01:14Z","timestamp":1620028874000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23951-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642239502","9783642239519"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23951-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}