{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:51:05Z","timestamp":1725475865111},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540676959"},{"type":"electronic","value":"9783540449942"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10722028_7","type":"book-chapter","created":{"date-parts":[[2006,12,29]],"date-time":"2006-12-29T18:45:30Z","timestamp":1167417930000},"page":"135-152","source":"Crossref","is-referenced-by-count":2,"title":["New Results on Lattice Basis Reduction in Practice"],"prefix":"10.1007","author":[{"given":"Werner","family":"Backes","sequence":"first","affiliation":[]},{"given":"Susanne","family":"Wetzel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating Hard Instances of Lattice Problems. In: Proceedings of the 28th ACM Symposium on Theory of Computing, pp. 99\u2013108 (1996)","DOI":"10.1145\/237814.237838"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Dwork, C.: A Public-Key Cryptosystem with Worst-Case\/Average- Case Equivalence. In: Proceedings of the 29th ACM Symposium on Theory of Computing, pp. 284\u2013293 (1997)","DOI":"10.1145\/258533.258604"},{"key":"7_CR3","unstructured":"Biehl, I., Buchmann, J., Papanikolaou, T.: LiDIA: A Library for Computational Number Theory. Technical Report 03\/95, SFB 124, Universit\u00e4t des Saarlandes, Saarbr\u00fccken, Germany (1995)"},{"key":"7_CR4","doi-asserted-by":"crossref","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, 2nd edn. Springer, Heidelberg (1993)","edition":"2"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/3-540-68339-9_14","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"D. Coppersmith","year":"1996","unstructured":"Coppersmith, D.: Finding a Small Root of a Univariate Modular Equation. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 155\u2013165. Springer, Heidelberg (1996)"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01201999","volume":"2","author":"M.J. Coster","year":"1992","unstructured":"Coster, M.J., Joux, A., LaMacchia, B.A., Odlyzko, A.M., Schnorr, C.P., Stern, J.: Improved Low-Density Subset Sum Algorithms. Journal of Computational Complexity\u00a02, 111\u2013128 (1992)","journal-title":"Journal of Computational Complexity"},{"issue":"1","key":"7_CR7","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1287\/moor.12.1.50","volume":"12","author":"P.D. Domich","year":"1987","unstructured":"Domich, P.D., Kannan, R., Trotter, L.E.: Hermite Normal Form Computation using Modulo Determinant Arithmetic. Mathematics Operations Research\u00a012(1), 50\u201359 (1987)","journal-title":"Mathematics Operations Research"},{"key":"7_CR8","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 Lat- tice Reduction Problems. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 112\u2013131. Springer, Heidelberg (1997)"},{"key":"7_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-78240-4","volume-title":"Geometric Algorithms and Combina- torial Optimization","author":"M. Gr\u00f6tschel","year":"1993","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combina- torial Optimization, 2nd edn. Springer, Heidelberg (1993)","edition":"2"},{"key":"7_CR10","unstructured":"Havas, G., Majewski, B.S., Matthews, K.R.: Extended GCD Algorithms. Technical Report TR0302, The University of Queensland, Brisbane, Australia (1994)"},{"issue":"3","key":"7_CR11","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s001459900042","volume":"11","author":"A. Joux","year":"1998","unstructured":"Joux, A., Stern, J.: Lattice Reduction: A Toolbox for the Cryptanalyst. Journal of Cryptology\u00a011(3), 161\u2013185 (1998)","journal-title":"Journal of Cryptology"},{"key":"7_CR12","volume-title":"The Art of Computer Programming. Seminumerical algo- rithms","author":"D.E. Knuth","year":"1981","unstructured":"Knuth, D.E.: The Art of Computer Programming. Seminumerical algo- rithms, 2nd edn., vol.\u00a02. Addison-Wesley, Reading (1981)","edition":"2"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A.K. Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, H.W., Lov\u00e1sz, L.: Factoring Polynomials with Rational Coefficients. Math. Ann.\u00a0261, 515\u2013534 (1982)","journal-title":"Math. Ann."},{"key":"7_CR14","unstructured":"LiDIA Group: LiDIA Manual. Universit\u00e1t des Saarlandes\/TU Darmstadt, Germany, see LiDIA homepage (1999), \n                    \n                      http:\/\/www.informatik.tu-darmstadt.de\/TI\/LiDIA"},{"key":"7_CR15","unstructured":"Magma homepage (1999), \n                    \n                      http:\/\/www.maths.usyd.edu.au:8000\/comp\/magma\/Overview.html"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1007\/3-540-48405-1_18","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"P. Nguyen","year":"1999","unstructured":"Nguyen, P.: 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":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-48892-8_17","volume-title":"Selected Areas in Cryptography","author":"P. Nguyen","year":"1999","unstructured":"Nguyen, P., Stern, J.: Cryptanalysis of a Fast Public Key Cryptosystem Pre- sented at SAC 1997. In: Tavares, S., Meijer, H. (eds.) SAC 1998. LNCS, vol.\u00a01556, p. 213. Springer, Heidelberg (1999)"},{"key":"7_CR18","unstructured":"NTL homepage (1999), \n                    \n                      http:\/\/www.cs.wisc.edu\/~shoup\/ntl"},{"key":"7_CR19","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.J.: Algorithmic Algebraic Number Theory. Cambridge University Press, Cambridge (1989)"},{"key":"7_CR20","first-page":"49","volume":"3","author":"S. Radziszowski","year":"1988","unstructured":"Radziszowski, S., Kreher, D.L.: Solving Subset Sum Problems with the L 3\n                           Algorithm. J. Combin. Math. Combin. Computation\u00a03, 49\u201363 (1988)","journal-title":"J. Combin. Math. Combin. Computation"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Rickert, N.W.: Efficient Reduction of Quadratic Forms. In: Proceedings of Computers and Mathematics 1989, pp. 135\u2013139 (1989)","DOI":"10.1007\/978-1-4613-9647-5_17"},{"key":"7_CR22","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 Al- gorithms and Solving Subset Sum Problems. In: Budach, L. (ed.) FCT 1991. LNCS, vol.\u00a0529, pp. 68\u201385. Springer, Heidelberg (1991)"},{"key":"7_CR23","unstructured":"de Weger, B.: Algorithms for Diophantine Equations. PhD Thesis, Centrum voor Wiskunde en Informatica, Amsterdam, Netherlands (1988)"},{"key":"7_CR24","unstructured":"Wetzel, S.: Lattice Basis Reduction Algorithms and their Applications. PhD Thesis, Universit\u00e1t des Saarlandes, Saarbr\u00facken, Germany (1998)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Number Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10722028_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T19:30:29Z","timestamp":1558294229000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10722028_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540676959","9783540449942"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/10722028_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}