{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:55:11Z","timestamp":1725897311663},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642341588"},{"type":"electronic","value":"9783642341595"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34159-5_3","type":"book-chapter","created":{"date-parts":[[2012,10,6]],"date-time":"2012-10-06T03:34:12Z","timestamp":1349494452000},"page":"30-44","source":"Crossref","is-referenced-by-count":1,"title":["Full Lattice Basis Reduction on Graphics Cards"],"prefix":"10.1007","author":[{"given":"Timo","family":"Bartkewitz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tim","family":"G\u00fcneysu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1145\/237814.237838","volume-title":"STOC 1996: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing","author":"M. Ajtai","year":"1996","unstructured":"Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: STOC 1996: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pp. 99\u2013108. ACM, New York (1996)"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1145\/258533.258604","volume-title":"STOC 1997: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing","author":"M. Ajtai","year":"1997","unstructured":"Ajtai, M., Dwork, C.: A public-key cryptosystem with worst-case\/average-case equivalence. In: STOC 1997: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pp. 284\u2013293. ACM, New York (1997)"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/978-3-642-03356-8_35","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"B. Applebaum","year":"2009","unstructured":"Applebaum, B., Cash, D., Peikert, C., Sahai, A.: Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 595\u2013618. Springer, Heidelberg (2009)"},{"key":"3_CR4","unstructured":"Backes, W., Wetzel, S.: A Parallel LLL using POSIX Threads. Tech. rep., Dept. of Computer Science, Stevens Institute of Technology (2009), dIMACS Technical Report 2008-12"},{"key":"3_CR5","unstructured":"Brakerski, Z., Goldwasser, S., Kalai, Y.: Circular-Secure Encryption Beyond Affine Functions. Cryptology ePrint Archive, Report 2009\/485 (2009), \n                  \n                    http:\/\/eprint.iacr.org\/"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Buchmann, J., Lindner, R., R\u00fcckert, M., Schneider, M.: Explicit hard instances of the shortest vector problem. Cryptology ePrint Archive, Report 2008\/333 (2008), \n                  \n                    http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-540-88403-3_6"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Stehl\u00e9, D., Steinfeld, R., Tanaka, K., Xagawa, K.: Efficient Public Key Encryption Based on Ideal Lattices. Cryptology ePrint Archive, Report 2009\/285 (2009), \n                  \n                    http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-642-10366-7_36"},{"key":"3_CR8","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":"3_CR9","volume-title":"Handbook of Computational Statistics","author":"J. Gentle","year":"2004","unstructured":"Gentle, J., H\u00e4rdle, W., Mori, Y.: Handbook of Computational Statistics. Springer, Heidelberg (2004)"},{"key":"3_CR10","unstructured":"Goldreich, O., Goldwasser, S., Halevi, S.: Collision-Free Hashing from Lattice Problems (1996)"},{"key":"3_CR11","unstructured":"Heckler, C.: Automatische Parallelisierung und parallele Gitterbasisreduktion. Ph.D. thesis, Universit\u00e4t des Saarlandes, Saarbr\u00fccken (1995)"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1007\/3-540-56891-3_74","volume-title":"PARLE \u201993 Parallel Architectures and Languages Europe","author":"C. Heckler","year":"1993","unstructured":"Heckler, C., Thiele, L.: Parallel Complexitiy of Lattice Basis Reduction and a Floating-Point Parallel Algorithm. In: Reeve, M., Bode, A., Wolf, G. (eds.) PARLE 1993. LNCS, vol.\u00a0694, pp. 744\u2013747. Springer, Heidelberg (1993)"},{"key":"3_CR13","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":"3_CR14","unstructured":"Hinek, M.: Lattice Attacks in Cryptography: A Partial Overview. Tech. rep., School of Computer Science, University of Waterloo (2004)"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BFb0054868","volume-title":"Algorithmic Number Theory","author":"J. Hoffstein","year":"1998","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: A Ring-Based Public Key Cryptosystem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol.\u00a01423, pp. 267\u2013288. Springer, Heidelberg (1998)"},{"key":"3_CR16","unstructured":"Joux, A.: A Fast Parallel Lattice Basis Reduction Algorithm. In: Proceedings of the Second Gauss Symposium, pp. 1\u201315 (1993)"},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s001459900042","volume":"11","author":"A. Joux","year":"1994","unstructured":"Joux, A., Stern, J.: Lattice Reduction: a Toolbox for the Cryptanalyst. Journal of Cryptology\u00a011, 161\u2013185 (1994)","journal-title":"Journal of Cryptology"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Kerr, A., Campbell, D., Richards, M.: QR Decomposition on GPUs. Tech. rep., Georgia Institue of Technlogogy, Georgia Tech Research Institute (2009)","DOI":"10.1145\/1513895.1513904"},{"key":"3_CR19","unstructured":"Khronos Group: The OpenCL Specification Version 1.1 (2011), \n                  \n                    http:\/\/www.khronos.org\/registry\/cl\/specs\/opencl-1.1.pdf"},{"key":"3_CR20","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":"3_CR21","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A. Lenstra","year":"1982","unstructured":"Lenstra, A., Lenstra, H., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Mathematische Annalen\u00a0261(4), 515\u2013534 (1982)","journal-title":"Mathematische Annalen"},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-540-71039-4_4","volume-title":"Fast Software Encryption","author":"V. Lyubashevsky","year":"2008","unstructured":"Lyubashevsky, V., Micciancio, D., Peikert, C., Rosen, A.: SWIFFT: A Modest Proposal for FFT Hashing. In: Nyberg, K. (ed.) FSE 2008. LNCS, vol.\u00a05086, pp. 54\u201372. Springer, Heidelberg (2008)"},{"key":"3_CR23","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1109\/TIT.1978.1055927","volume":"24","author":"R. Merkle","year":"1978","unstructured":"Merkle, R., Hellman, M.: Hiding information and signatures in trapdoor knapsacks. IEEE Transactions on Information Theory\u00a024, 525\u2013530 (1978)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"3_CR24","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1137\/070705702","volume":"39","author":"P.Q. Nguyen","year":"2009","unstructured":"Nguyen, P.Q., Stehl\u00e9, D.: An LLL Algorithm with Quadratic Complexity. SIAM Journal on Computing\u00a039(3), 874\u2013903 (2009)","journal-title":"SIAM Journal on Computing"},{"key":"3_CR25","unstructured":"nVidia: NVIDIA CUDA Development Tools (2010), \n                  \n                    http:\/\/developer.download.nvidia.com\/compute\/cuda\/3_2\/docs\/Getting_Started_Windows.pdf"},{"key":"3_CR26","unstructured":"nVidia: NVIDIA CUDA Programming Guide (2010), \n                  \n                    http:\/\/developer.download.nvidia.com\/compute\/cuda\/3_2\/toolkit\/docs\/CUDA_C_Programming_Guide.pdf"},{"key":"3_CR27","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/1536414.1536461","volume-title":"STOC 2009: Proceedings of the 41st Annual ACM Symposium on Theory of Computing","author":"C. Peikert","year":"2009","unstructured":"Peikert, C.: Public-key cryptosystems from the worst-case shortest vector problem: extended abstract. In: STOC 2009: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, pp. 333\u2013342. ACM, New York (2009)"},{"issue":"6","key":"3_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O. Regev","year":"2009","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM\u00a056(6), 1\u201340 (2009)","journal-title":"J. ACM"},{"key":"3_CR29","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"Rivest, R., Shamir, A., Adleman, L.: A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the ACM\u00a021, 120\u2013126 (1978)","journal-title":"Communications of the ACM"},{"key":"3_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-642-23951-9_11","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2011","author":"M. Schneider","year":"2011","unstructured":"Schneider, M., G\u00f6ttert, N.: Random Sampling for Short Lattice Vectors on Graphics Cards. In: Preneel, B., Takagi, T. (eds.) CHES 2011. LNCS, vol.\u00a06917, pp. 160\u2013175. Springer, Heidelberg (2011)"},{"issue":"2","key":"3_CR31","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. Program.\u00a066(2), 181\u2013199 (1994)","journal-title":"Math. Program."},{"key":"3_CR32","unstructured":"Shoup, V.: NTL: A Library for doing Number Theory, \n                  \n                    http:\/\/www.shoup.net\/ntl\/"},{"key":"3_CR33","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1145\/143242.143327","volume-title":"ISSAC 1992: Papers from the International Symposium on Symbolic and Algebraic Computation","author":"G. Villard","year":"1992","unstructured":"Villard, G.: Parallel lattice basis reduction. In: ISSAC 1992: Papers from the International Symposium on Symbolic and Algebraic Computation, pp. 269\u2013277. ACM, New York (1992)"},{"key":"3_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/BFb0054872","volume-title":"Algorithmic Number Theory","author":"S. Wetzel","year":"1998","unstructured":"Wetzel, S.: An Efficient Parallel Block-Reduction Algorithm. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol.\u00a01423, pp. 323\u2013337. Springer, Heidelberg (1998)"},{"key":"3_CR35","unstructured":"Wiese, K.: Parallelisierung von LLL-Algorithmen zur Gitterbasisreduktionen. Master\u2019s thesis, Universit\u00e4t des Saarlandes (1994)"}],"container-title":["Lecture Notes in Computer Science","Research in Cryptology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34159-5_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T08:46:30Z","timestamp":1620117990000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34159-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642341588","9783642341595"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34159-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}