{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T11:01:35Z","timestamp":1753441295709},"publisher-location":"Berlin, Heidelberg","reference-count":60,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642126772"},{"type":"electronic","value":"9783642126789"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12678-9_4","type":"book-chapter","created":{"date-parts":[[2010,4,29]],"date-time":"2010-04-29T11:28:35Z","timestamp":1272540515000},"page":"52-68","source":"Crossref","is-referenced-by-count":24,"title":["Parallel Shortest Lattice Vector Enumeration on Graphics Cards"],"prefix":"10.1007","author":[{"given":"Jens","family":"Hermans","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Schneider","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johannes","family":"Buchmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frederik","family":"Vercauteren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bart","family":"Preneel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Dwork, C.: A public-key cryptosystem with worst-case\/average-case equivalence. In: Proceedings of the Annual Symposium on the Theory of Computing \u2014 STOC 1997, pp. 284\u2013293 (1997)","DOI":"10.1145\/258533.258604"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1145\/380752.380857","volume-title":"Proceedings of the Annual Symposium on the Theory of Computing \u2014 STOC 2001","author":"M. Ajtai","year":"2001","unstructured":"Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: Proceedings of the Annual Symposium on the Theory of Computing \u2014 STOC 2001, pp. 601\u2013610. ACM Press, New York (2001)"},{"key":"4_CR3","unstructured":"Advanced\u00a0Micro Devices. ATI CTM Guide. Technical report (2006)"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-642-01001-9_28","volume-title":"EUROCRYPT 2009","author":"D.J. Bernstein","year":"2009","unstructured":"Bernstein, D.J., Chen, T.-R., Cheng, C.-M., Lange, T., Yang, B.-Y.: ECM on graphics cards. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol.\u00a05479, pp. 483\u2013501. Springer, Heidelberg (2009)"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/11792086_17","volume-title":"Algorithmic Number Theory","author":"J. Buchmann","year":"2006","unstructured":"Buchmann, J., Ludwig, C.: Practical lattice basis sampling reduction. In: Hess, F., Pauli, S., Pohst, M. (eds.) ANTS 2006. LNCS, vol.\u00a04076, pp. 222\u2013237. Springer, Heidelberg (2006)"},{"key":"4_CR6","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":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1007\/978-3-540-30574-3_23","volume-title":"Topics in Cryptology \u2013 CT-RSA 2005","author":"D.L. Cook","year":"2005","unstructured":"Cook, D.L., Ioannidis, J., Keromytis, A.D., Luck, J.: Cryptographics: Secret key cryptography using graphics cards. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol.\u00a03376, pp. 334\u2013350. Springer, Heidelberg (2005)"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/3-540-49162-7_16","volume-title":"Public Key Cryptography","author":"C. Coup\u00e9","year":"1999","unstructured":"Coup\u00e9, C., Nguyen, P.Q., Stern, J.: The effectiveness of lattice attacks against low exponent RSA. In: Imai, H., Zheng, Y. (eds.) PKC 1999. LNCS, vol.\u00a01560, pp. 204\u2013218. Springer, Heidelberg (1999)"},{"key":"4_CR9","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":"4_CR10","unstructured":"Dagdelen, \u00d6.: Parallelisierung von Gitterbasisreduktionen. Masters thesis, TU Darmstadt (2009)"},{"issue":"1","key":"4_CR11","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S0304-3975(01)00290-0","volume":"285","author":"I. Dinur","year":"2002","unstructured":"Dinur, I.: Approximating SVP\u2009\u221e\u2009 to within almost-polynomial factors is NP-hard. Theoretical Computer Science\u00a0285(1), 55\u201371 (2002)","journal-title":"Theoretical Computer Science"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/3-540-44448-3_2","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"G. Durfee","year":"2000","unstructured":"Durfee, G., Nguyen, P.Q.: Cryptanalysis of the RSA schemes with short secret exponent from Asiacrypt 1999. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 14\u201329. Springer, Heidelberg (2000)"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-540-72584-8_28","volume-title":"Computational Science \u2013 ICCS 2007","author":"S. Fleissner","year":"2007","unstructured":"Fleissner, S.: GPU-Accelerated Montgomery Exponentiation. In: Shi, Y., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds.) ICCS 2007. LNCS, vol.\u00a04487, pp. 213\u2013220. Springer, Heidelberg (2007)"},{"key":"4_CR14","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.: 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":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/BFb0052231","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"O. Goldreich","year":"1997","unstructured":"Goldreich, O., Goldwasser, S., Halevi, S.: Public-key cryptosystems from lattice reduction problems. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 112\u2013131. Springer, Heidelberg (1997)"},{"issue":"2","key":"4_CR16","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":"4_CR17","first-page":"207","volume-title":"Proceedings of the Annual Symposium on the Theory of Computing \u2014 STOC 2008","author":"N. Gama","year":"2008","unstructured":"Gama, N., Nguyen, P.Q.: Finding short lattice vectors within Mordell\u2019s inequality. In: Proceedings of the Annual Symposium on the Theory of Computing \u2014 STOC 2008, pp. 207\u2013216. ACM Press, New York (2008)"},{"key":"4_CR18","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":"4_CR19","first-page":"197","volume-title":"Proceedings of the Annual Symposium on the Theory of Computing \u2014 STOC 2008","author":"C. Gentry","year":"2008","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of the Annual Symposium on the Theory of Computing \u2014 STOC 2008, pp. 197\u2013206. ACM Press, New York (2008)"},{"key":"4_CR20","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":"4_CR21","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":"4_CR22","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1109\/SPDP.1993.395505","volume-title":"IEEE Symposium on Parallel and Distributed Processing \u2014 SPDP","author":"C. Heckler","year":"1993","unstructured":"Heckler, C., Thiele, L.: A parallel lattice basis reduction for mesh-connected processor arrays and parallel complexity. In: IEEE Symposium on Parallel and Distributed Processing \u2014 SPDP, pp. 400\u2013407. IEEE Computer Society Press, Los Alamitos (1993)"},{"issue":"5","key":"4_CR23","doi-asserted-by":"publisher","first-page":"1295","DOI":"10.1137\/S0097539795295626","volume":"27","author":"C. Heckler","year":"1998","unstructured":"Heckler, C., Thiele, L.: Complexity analysis of a parallel lattice basis reduction algorithm. SIAM J. Comput.\u00a027(5), 1295\u20131302 (1998)","journal-title":"SIAM J. Comput."},{"key":"4_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-540-74735-2_15","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2007","author":"O. Harrison","year":"2007","unstructured":"Harrison, O., Waldron, J.: AES Encryption Implementation and Analysis on Commodity Graphics Processing Units. In: Paillier, P., Verbauwhede, I. (eds.) CHES 2007. LNCS, vol.\u00a04727, pp. 209\u2013226. Springer, Heidelberg (2007)"},{"key":"4_CR25","unstructured":"Joux, A.: A fast parallel lattice reduction algorithm. In: Proceedings of the Second Gauss Symposium, pp. 1\u201315 (1993)"},{"key":"4_CR26","first-page":"193","volume-title":"Proceedings of the Annual Symposium on the Theory of Computing \u2014 STOC 1983","author":"R. Kannan","year":"1983","unstructured":"Kannan, R.: Improved algorithms for integer programming and related lattice problems. In: Proceedings of the Annual Symposium on the Theory of Computing \u2014 STOC 1983, pp. 193\u2013206. ACM Press, New York (1983)"},{"issue":"5","key":"4_CR27","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1145\/1089023.1089027","volume":"52","author":"S. Khot","year":"2005","unstructured":"Khot, S.: Hardness of approximating the shortest vector problem in lattices. J. ACM\u00a052(5), 789\u2013808 (2005)","journal-title":"J. ACM"},{"key":"4_CR28","unstructured":"Koy, H.: Primale-duale Segment-Reduktion (2004), http:\/\/www.mi.informatik.uni-frankfurt.de\/research\/papers.html"},{"key":"4_CR29","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H.W. Lenstra","year":"1983","unstructured":"Lenstra, H.W.: Integer programming with a fixed number of variables. Math. Oper. Res.\u00a08, 538\u2013548 (1983)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"4_CR30","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":"4_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-540-78524-8_3","volume-title":"Theory of Cryptography","author":"V. Lyubashevsky","year":"2008","unstructured":"Lyubashevsky, V., Micciancio, D.: Asymptotically efficient lattice-based digital signatures. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 37\u201354. Springer, Heidelberg (2008)"},{"key":"4_CR32","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)"},{"issue":"1","key":"4_CR33","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1145\/2455.2461","volume":"32","author":"J.C. Lagarias","year":"1985","unstructured":"Lagarias, J.C., Odlyzko, A.M.: Solving low-density subset sum problems. Journal of the ACM\u00a032(1), 229\u2013246 (1985)","journal-title":"Journal of the ACM"},{"key":"4_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1007\/978-3-642-10366-7_35","volume-title":"Asiacrypt 2009","author":"V. Lyubashevsky","year":"2009","unstructured":"Lyubashevsky, V.: Fiat-Shamir with aborts: Applications to lattice and factoring-based signatures. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol.\u00a05912, pp. 598\u2013616. Springer, Heidelberg (2009)"},{"key":"4_CR35","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1109\/ICSPC.2007.4728256","volume-title":"IEEE International Conference on Signal Processing and Communications \u2014 ICSPC","author":"S.A. Manavski","year":"2007","unstructured":"Manavski, S.A.: Cuda Compatible GPU as an Efficient Hardware Accelerator for AES Cryptography. In: IEEE International Conference on Signal Processing and Communications \u2014 ICSPC, pp. 65\u201368. IEEE Computer Society Press, Los Alamitos (2007)"},{"key":"4_CR36","first-page":"315","volume-title":"The LLL algorithm","author":"A. May","year":"2010","unstructured":"May, A.: Using LLL-reduction for solving RSA and factorization problems. In: Nguyen, P.Q., Vall\u00e9e, B. (eds.) The LLL algorithm, pp. 315\u2013348. Springer, Heidelberg (2010)"},{"key":"4_CR37","series-title":"The Kluwer International Series in Engineering and Computer Science","doi-asserted-by":"crossref","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. The Kluwer International Series in Engineering and Computer Science, vol.\u00a0671. Kluwer Academic Publishers, Boston (2002)"},{"key":"4_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-540-77272-9_22","volume-title":"Cryptography and Coding","author":"A. Moss","year":"2007","unstructured":"Moss, A., Page, D., Smart, N.P.: Toward Acceleration of RSA Using 3D Graphics Hardware. In: Galbraith, S.D. (ed.) Cryptography and Coding 2007. LNCS, vol.\u00a04887, pp. 364\u2013383. Springer, Heidelberg (2007)"},{"key":"4_CR39","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Voulgaris, P.: Faster exponential time algorithms for the shortest vector problem. In: Proceedings of the Annual Symposium on Discrete Algorithms \u2014 SODA 2010 (2010)","DOI":"10.1137\/1.9781611973075.119"},{"key":"4_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/11426639_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"P.Q. Nguyen","year":"2005","unstructured":"Nguyen, P.Q., Stehl\u00e9, D.: Floating-point LLL revisited. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 215\u2013233. Springer, Heidelberg (2005)"},{"key":"4_CR41","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. Nguyen","year":"2006","unstructured":"Nguyen, 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":"4_CR42","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":"4_CR43","unstructured":"Nvidia. Compute Unified Device Architecture Programming Guide. Technical report (2007)"},{"key":"4_CR44","unstructured":"NVIDIA. CUBLAS Library (2007)"},{"key":"4_CR45","unstructured":"1363 Working\u00a0Group of\u00a0the C\/MM\u00a0Committee. IEEE P1363.1 Standard Specification for Public-Key Cryptographic Techniques Based on Hard Problems over Lattices (2009), http:\/\/grouper.ieee.org\/groups\/1363\/"},{"key":"4_CR46","unstructured":"Peikert, C.: Bonsai trees (or, arboriculture in lattice-based cryptography). Cryptology ePrint Archive, Report 2009\/359 (2009), http:\/\/eprint.iacr.org\/"},{"key":"4_CR47","doi-asserted-by":"crossref","unstructured":"Peikert, C.: Public-key cryptosystems from the worst-case shortest vector problem: extended abstract. In: Proceedings of the Annual Symposium on the Theory of Computing \u2014 STOC 2009, pp. 333\u2013342 (2009)","DOI":"10.1145\/1536414.1536461"},{"key":"4_CR48","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":"4_CR49","unstructured":"Pujol, X.: Recherche efficace de vecteur court dans un r\u00e9seau euclidien. Masters thesis, ENS Lyon (2008)"},{"key":"4_CR50","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1145\/1132516.1132581","volume-title":"Proceedings of the Annual Symposium on the Theory of Computing \u2014 STOC 2006","author":"O. Regev","year":"2006","unstructured":"Regev, O., Rosen, R.: Lattice problems and norm embeddings. In: Proceedings of the Annual Symposium on the Theory of Computing \u2014 STOC 2006, pp. 447\u2013456. ACM Press, New York (2006)"},{"key":"4_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1007\/3-540-55895-0_455","volume-title":"Parallel Processing: CONPAR 92 - VAPP V","author":"J.-L. Roch","year":"1992","unstructured":"Roch, J.-L., Villard, G.: Parallel gcd and lattice basis reduction. In: Boug\u00e9, L., Robert, Y., Trystram, D., Cosnard, M. (eds.) CONPAR 1992 and VAPP 1992. LNCS, vol.\u00a0634, pp. 557\u2013564. Springer, Heidelberg (1992)"},{"key":"4_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/3-540-46416-6_24","volume-title":"Advances in Cryptology - EUROCRYPT \u201991","author":"C.-P. Schnorr","year":"1991","unstructured":"Schnorr, C.-P.: Factoring integers and computing discrete logarithms via diophantine approximations. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol.\u00a0547, pp. 281\u2013293. Springer, Heidelberg (1991)"},{"key":"4_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/3-540-36494-3_14","volume-title":"STACS 2003","author":"C.-P. Schnorr","year":"2003","unstructured":"Schnorr, C.-P.: Lattice reduction by random sampling and birthday methods. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol.\u00a02607, pp. 145\u2013156. Springer, Heidelberg (2003)"},{"key":"4_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/3-540-54458-5_51","volume-title":"Fundamentals of Computation Theory","author":"C.-P. Schnorr","year":"1991","unstructured":"Schnorr, C.-P., Euchner, M.: Lattice basis reduction: Improved practical algorithms and solving subset sum problems. In: Budach, L. (ed.) FCT 1991. LNCS, vol.\u00a0529, pp. 68\u201385. Springer, Heidelberg (1991)"},{"key":"4_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-540-85053-3_6","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2008","author":"R. Szerwinski","year":"2008","unstructured":"Szerwinski, R., Guneysu, T.: Exploiting the Power of GPUs for Asymmetric Cryptography. In: Oswald, E., Rohatgi, P. (eds.) CHES 2008. LNCS, vol.\u00a05154, pp. 79\u201399. Springer, Heidelberg (2008)"},{"key":"4_CR56","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":"4_CR57","unstructured":"Shoup, V.: Number theory library (NTL) for C++, http:\/\/www.shoup.net\/ntl\/"},{"key":"4_CR58","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/978-3-642-10366-7_36","volume-title":"ASIACRYPT 2009","author":"D. Stehl\u00e9","year":"2009","unstructured":"Stehl\u00e9, D., Steinfeld, R., Tanaka, K., Xagawa, K.: Efficient public key encryption based on ideal lattices. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol.\u00a05912, pp. 617\u2013635. Springer, Heidelberg (2009)"},{"key":"4_CR59","first-page":"269","volume-title":"International Symposium on Symbolic and Algebraic Computation \u2014 ISSAC","author":"G. Villard","year":"1992","unstructured":"Villard, G.: Parallel lattice basis reduction. In: International Symposium on Symbolic and Algebraic Computation \u2014 ISSAC, pp. 269\u2013277. ACM Press, New York (1992)"},{"key":"4_CR60","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)"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 AFRICACRYPT 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12678-9_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:56:14Z","timestamp":1606186574000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12678-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642126772","9783642126789"],"references-count":60,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12678-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}