{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,9]],"date-time":"2025-05-09T18:23:58Z","timestamp":1746815038712,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642038686"},{"type":"electronic","value":"9783642038693"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03869-3_88","type":"book-chapter","created":{"date-parts":[[2009,8,22]],"date-time":"2009-08-22T04:04:48Z","timestamp":1250913888000},"page":"960-973","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Parallel Lattice Basis Reduction Using a Multi-threaded Schnorr-Euchner LLL Algorithm"],"prefix":"10.1007","author":[{"given":"Werner","family":"Backes","sequence":"first","affiliation":[]},{"given":"Susanne","family":"Wetzel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"88_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/10722028_7","volume-title":"Algorithmic Number Theory","author":"W. Backes","year":"2000","unstructured":"Backes, W., Wetzel, S.: New Results on Lattice Basis Reduction in Practice. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol.\u00a01838, pp. 135\u2013152. Springer, Heidelberg (2000)"},{"doi-asserted-by":"crossref","unstructured":"Backes, W., Wetzel, S.: Heuristics on Lattice Basis Reduction in Practice. ACM Journal on Experimental Algorithms\u00a07 (2002)","key":"88_CR2","DOI":"10.1145\/944618.944619"},{"key":"88_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-75187-8_4","volume-title":"Computer Algebra in Scientific Computing","author":"W. Backes","year":"2007","unstructured":"Backes, W., Wetzel, S.: An Efficient LLL Gram Using Buffered Transformations. In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2007. LNCS, vol.\u00a04770, pp. 31\u201344. Springer, Heidelberg (2007)"},{"key":"88_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11745853_1","volume-title":"Public Key Cryptography - PKC 2006","author":"D. Bleichenbacher","year":"2006","unstructured":"Bleichenbacher, D., May, A.: New Attacks on RSA with Small Secret CRT-Exponents. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T.G. (eds.) PKC 2006. LNCS, vol.\u00a03958, pp. 1\u201313. Springer, Heidelberg (2006)"},{"key":"88_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/11426639_15","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"J. Bl\u00f6mer","year":"2005","unstructured":"Bl\u00f6mer, J., May, A.: A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 251\u2013267. Springer, Heidelberg (2005)"},{"key":"88_CR6","volume-title":"Programming with POSIX threads","author":"D.R. Butenhof","year":"1997","unstructured":"Butenhof, D.R.: Programming with POSIX threads. Addison-Wesley Longman Publishing Co., Inc., Boston (1997)"},{"key":"88_CR7","series-title":"Undergraduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02945-9","volume-title":"A Course in Computational Algebraic Number Theory","author":"H. Cohen","year":"1993","unstructured":"Cohen, H.: A Course in Computational Algebraic Number Theory. Undergraduate Texts in Mathematics. Springer, Heidelberg (1993)"},{"key":"88_CR8","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01201999","volume":"2","author":"M. Coster","year":"1992","unstructured":"Coster, M., Joux, A., LaMacchia, B., Odlyzko, A., Schnorr, C., Stern, J.: Improved Low-Density Subset Sum Algorithm. Journal of Computational Complexity\u00a02, 111\u2013128 (1992)","journal-title":"Journal of Computational Complexity"},{"key":"88_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/3-540-46416-6_4","volume-title":"Advances in Cryptology - EUROCRYPT \u201991","author":"M. Coster","year":"1991","unstructured":"Coster, M., LaMacchia, B., Odlyzko, A., Schnorr, C.: An Improved Low-Density Subset Sum Algorithm. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol.\u00a0547, pp. 54\u201367. Springer, Heidelberg (1991)"},{"key":"88_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1007\/0-387-34805-0_39","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"I. Damg\u00e5rd","year":"1990","unstructured":"Damg\u00e5rd, I.: A design principle for hash functions. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 416\u2013427. Springer, Heidelberg (1990)"},{"unstructured":"Filipovic, B.: Implementierung der Gitterbasenreduktion in Segmenten. Master\u2019s thesis, University of Frankfurt am Main (2002)","key":"88_CR11"},{"doi-asserted-by":"crossref","unstructured":"Goldstein, A., Mayer, A.: On the equidistribution of Hecke points. In: Formum Mathematicum, vol.\u00a015, pp. 165\u2013189 (2003)","key":"88_CR12","DOI":"10.1515\/form.2003.009"},{"unstructured":"Heckler, C.: Automatische Parallelisierung und parallele Gitterbasisreduktion. PhD thesis, Universit\u00e4t des Saarlandes, Saarbr\u00fccken (1995)","key":"88_CR13"},{"key":"88_CR14","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)"},{"doi-asserted-by":"crossref","unstructured":"Heckler, C., Thiele, L.: A parallel lattice basis reduction for mesh-connected processor arrays and parallel complexity. In: Proceedings of SPDP 1993, Dallas, pp. 400\u2013407 (1993)","key":"88_CR15","DOI":"10.1109\/SPDP.1993.395505"},{"unstructured":"Joux, A.: A Fast Parallel Lattice Basis Reduction Algorithm. In: Proceedings of the Second Gauss Symposium, pp. 1\u201315 (1993)","key":"88_CR16"},{"unstructured":"Joux, A.: La R\u00e9duction des R\u00e9seaux en Cryptographie. PhD thesis, Labaratoire d\u2019Informatique de L\u2019Ecole Normale Superieure LIENS, Paris, France (1993)","key":"88_CR17"},{"key":"88_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/3-540-44670-2_8","volume-title":"Cryptography and Lattices","author":"H. Koy","year":"2001","unstructured":"Koy, H., Schnorr, C.: Segment LLL-Reduction with Floating Point Orthogonalization. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol.\u00a02146, pp. 81\u201396. Springer, Heidelberg (2001)"},{"key":"88_CR19","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1145\/2455.2461","volume":"32","author":"C. Lagarias","year":"1985","unstructured":"Lagarias, C., Odlyzko, A.: Solving Low-Density Subset Sum Problems. JACM\u00a032, 229\u2013246 (1985)","journal-title":"JACM"},{"key":"88_CR20","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. Math. Ann.\u00a0261, 515\u2013534 (1982)","journal-title":"Math. Ann."},{"key":"88_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/3-540-55895-0_455","volume-title":"Parallel Processing: CONPAR 92 - VAPP V","author":"J.-L. Louis Roch","year":"1992","unstructured":"Louis Roch, J.-L., Villard, G.: Parallel gcd and lattice basis reduction. In: CONPAR 1992 and VAPP 1992. LNCS, vol.\u00a0634, pp. 557\u2013564. Springer, Heidelberg (1992)"},{"unstructured":"May, A.: New RSA Vulnerabilities Using Lattice Reduction Methods. PhD thesis, University of Paderborn (2003)","key":"88_CR22"},{"key":"88_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-540-24632-9_16","volume-title":"Public Key Cryptography \u2013 PKC 2004","author":"A. May","year":"2004","unstructured":"May, A.: Secret Exponent Attacks on RSA-type Schemes with Moduli n=pr\u0302q. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol.\u00a02947, pp. 218\u2013230. Springer, Heidelberg (2004)"},{"key":"88_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0897-7","volume-title":"Ccomplexity of Lattice Problems\u2014A Cryptographic Perspective","author":"D. Micciancio","year":"2002","unstructured":"Micciancio, D., Goldwasser, S.: Ccomplexity of Lattice Problems\u2014A Cryptographic Perspective. Kluwer Academic Publishers, Dordrecht (2002)"},{"key":"88_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/978-3-540-24847-7_26","volume-title":"Algorithmic Number Theory","author":"P.Q. Nguy\u00ean","year":"2004","unstructured":"Nguy\u00ean, P.Q., Stehl\u00e9, D.: Low-dimensional lattice basis reduction revisited. In: Buell, D.A. (ed.) ANTS 2004. LNCS, vol.\u00a03076, pp. 338\u2013357. Springer, Heidelberg (2004)"},{"key":"88_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/11426639_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"P.Q. Ngu\u00ean","year":"2005","unstructured":"Ngu\u00ean, 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":"88_CR27","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":"88_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/11593447_3","volume-title":"Advances in Cryptology - ASIACRYPT 2005","author":"P. Nguyen","year":"2005","unstructured":"Nguyen, P., Stern, J.: Adapting Density Attacks to Low-Weight Knapsacks. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol.\u00a03788, pp. 41\u201358. Springer, Heidelberg (2005)"},{"key":"88_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/3-540-48405-1_18","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"P.Q. Nguyen","year":"1999","unstructured":"Nguyen, P.Q.: Cryptanalysis of the Goldreich-Goldwasser-Halevi Cryptosystem from Crypto 1997. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 288\u2013304. Springer, Heidelberg (1999)"},{"key":"88_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/10722028_4","volume-title":"Algorithmic Number Theory","author":"P.Q. Nguyen","year":"2000","unstructured":"Nguyen, P.Q., Stern, J.: Lattice Reduction in Cryptology: An Update. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol.\u00a01838, pp. 85\u2013112. Springer, Heidelberg (2000)"},{"key":"88_CR31","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511661952","volume-title":"Algorithmic Algebraic Number Theory","author":"M.E. Pohst","year":"1989","unstructured":"Pohst, M.E., Zassenhaus, H.: Algorithmic Algebraic Number Theory. Cambridge University Press, Cambridge (1989)"},{"key":"88_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/11818175_8","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"O. Regev","year":"2006","unstructured":"Regev, O.: Lattice-based cryptography. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 131\u2013141. Springer, Heidelberg (2006)"},{"key":"88_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/3-540-54458-5_51","volume-title":"Fundamentals of Computation Theory","author":"C. Schnorr","year":"1991","unstructured":"Schnorr, C., 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":"88_CR34","volume-title":"Advanced Programming in the UNIX(R) Environment","author":"R.W. Stevens","year":"2005","unstructured":"Stevens, R.W., Rago, S.A.: Advanced Programming in the UNIX(R) Environment, 2nd edn. Addison-Wesley Professional, Reading (2005)","edition":"2"},{"key":"88_CR35","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":"88_CR36","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)"},{"unstructured":"Wetzel, S.: Lattice Basis Reduction Algorithms and their Applications. PhD thesis, Universit\u00e4t des Saarlandes (1998)","key":"88_CR37"},{"unstructured":"Wiese, K.: Parallelisierung von LLL-Algorithmen zur Gitterbasisreduktion. Implementierung auf dem Intel iPSC\/860 Hypercube. Master\u2019s thesis, Universit\u00e4t des Saarlandes (1994)","key":"88_CR38"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2009 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03869-3_88","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T20:33:08Z","timestamp":1739305988000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03869-3_88"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642038686","9783642038693"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03869-3_88","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}