{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:30:11Z","timestamp":1742956211565,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540425120"},{"type":"electronic","value":"9783540446910"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","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":[[2001]]},"DOI":"10.1007\/3-540-44691-5_6","type":"book-chapter","created":{"date-parts":[[2007,6,2]],"date-time":"2007-06-02T22:32:07Z","timestamp":1180823527000},"page":"63-73","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Lattice Basis Reduction with Dynamic Approximation"],"prefix":"10.1007","author":[{"given":"Werner","family":"Backes","sequence":"first","affiliation":[]},{"given":"Susanne","family":"Wetzel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,24]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating Hard Instances of Lattice Problems. Proceedings of the 28th ACM Symposium on Theory of Computing, pp. 99\u2013108 (1996).","DOI":"10.1145\/237814.237838"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Ajtai, M., and Dwork, C.: A Public-Key Cryptosystem with Worst-Case\/Average-Case Equivalence. Proceedings of the 29th ACM Symposium on Theory of Computing, pp. 284\u2013293 (1997).","DOI":"10.1145\/258533.258604"},{"key":"6_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/10722028_7","volume-title":"New Results on Lattice Basis Reduction in Practice","author":"W. Backes","year":"2000","unstructured":"Backes, W., and Wetzel, S.: New Results on Lattice Basis Reduction in Practice. Proceedings of Fourth Algorithmic Number Theory Symposium (ANTS IV), Springer Lecture Notes in Computer Science LNCS 1838, pp. 135\u2013152(2000)."},{"key":"6_CR4","unstructured":"Biehl, I., Buchmann, J., and Papanikolaou, T.: LiDIA: A Library for Computational Number Theory. Technical Report 03\/95, SFB 124, Universit\u00e4t des Saarlandes, Saarbr\u00fccken, Germany (1995)."},{"key":"6_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/3-540-46416-6_3","volume-title":"The Knapsack Hash Function Proposed at CRYPTO\u2019 89 can be Broken","author":"P. Camion","year":"1991","unstructured":"Camion, P., and Patarin, J.: The Knapsack Hash Function Proposed at CRYPTO\u2019 89 can be Broken. Proceedings of EUROCRYPT\u2019 91, Springer Lecture Notes in Computer Science LNCS 547, pp. 39\u201353 (1991)."},{"key":"6_CR6","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. Second Edition, Springer-Verlag, Heidelberg (1993).","edition":"Second Edition"},{"key":"6_CR7","unstructured":"Coppersmith, D.: Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities. Journal of Cryptology, Vol. 10(4), pp. 233\u2013260 (1997)."},{"key":"6_CR8","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., and Stern, J.: Improved Low-Density Subset Sum Algorithms. Journal of Computational Complexity, Vol. 2, pp. 111\u2013128 (1992).","journal-title":"Journal of Computational Complexity"},{"key":"6_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1007\/0-387-34805-0_39","volume-title":"A Design Principle for Hash Functions","author":"I.B. Damg\u00e5rd","year":"1990","unstructured":"Damg\u00e5rd, I.B.: A Design Principle for Hash Functions. Proceedings of CRYPTO\u2019 89, Springer Lecture Notes in Computer Science LNCS 435, pp. 416\u2013427 (1989)."},{"issue":"2","key":"6_CR10","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1137\/0217016","volume":"17","author":"A.M. Frieze","year":"1988","unstructured":"Frieze, A.M., H\u00e5stad, J., Kannan, R., Lagarias, J.C., and Shamir, A.: Reconstructing Truncated Integer Variables Satisfying Linear Congruences. SIAM J. Comput. 17(2), pp. 262\u2013280 (1988).","journal-title":"SIAM J. Comput."},{"key":"6_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/BFb0052231","volume-title":"Public-Key-Cryptosystems from Lattice Reduction Problems","author":"O. Goldreich","year":"1997","unstructured":"Goldreich, O., Goldwasser, S., and Halevi, S.: Public-Key-Cryptosystems from Lattice Reduction Problems. Proceedings of CRYPTO\u2019 97, Springer Lecture Notes in Computer Science LNCS 1294, pp. 112\u2013131 (1997)."},{"key":"6_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-78240-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\u00f6tschel","year":"1993","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., and Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Second Edition, Springer-Verlag, Heidelberg (1993).","edition":"Second Edition"},{"issue":"3","key":"6_CR13","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s001459900042","volume":"11","author":"A. Joux","year":"1998","unstructured":"Joux, A., and Stern, J.: Lattice Reduction: A Toolbox for the Cryptanalyst. Journal of Cryptology, Vol. 11, No. 3, pp. 161\u2013185 (1998).","journal-title":"Journal of Cryptology"},{"key":"6_CR14","unstructured":"Lagarias, J.C.: Point Lattices. Handbook of Combinatorics, Vol. 1, Chapter 19, Elsevier (1995)."},{"key":"6_CR15","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., and Lov\u00e1sz, L.: Factoring Polynomials with Rational Coefficients. Math. Ann. 261, pp. 515\u2013534 (1982).","journal-title":"Math. Ann."},{"key":"6_CR16","volume-title":"LiDIA Manual","author":"LiDIA Group","year":"1999","unstructured":"LiDIA Group: LiDIA Manual. Universit\u00e4t des Saarlandes\/TU Darmstadt, Germany, see LiDIA homepage: \nhttp:\/\/www.informatik.tu-darmstadt.de\/TI\/LiDIA\n\n (1999)."},{"key":"6_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1007\/3-540-48405-1_18","volume-title":"Cryptanalysis of the Goldreich-Goldwasser-Halevi Cryptosystem from Crypto\u2019 97","author":"P. Nguyen","year":"1999","unstructured":"Nguyen, P.: Cryptanalysis of the Goldreich-Goldwasser-Halevi Cryptosystem from Crypto\u2019 97. Proceedings of Crypto\u2019 99, Springer Lecture Notes in Computer Science LNCS 1666, pp. 288\u2013304 (1999)."},{"key":"6_CR18","series-title":"Lect Notes Comput Sci","volume-title":"Cryptanalysis of a Fast Public Key Cryptosystem Presented at SAC\u2019 97","author":"P. Nguyen","year":"1999","unstructured":"Nguyen, P., and Stern, J.: Cryptanalysis of a Fast Public Key Cryptosystem Presented at SAC\u2019 97. Proceedings of Selected Areas in Cryptography\u2019 98, Springer Lecture Notes in Computer Science LNCS 1556 (1999)."},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Pohst, M.E., and Zassenhaus, H.J.: Algorithmic Algebraic Number Theory. Cambridge University Press (1989).","DOI":"10.1017\/CBO9780511661952"},{"key":"6_CR20","unstructured":"Press, W.H., Teukolsky, S.A., Vetterling, W.T., and Flannery, B.P.: Numerical Recipes in C. Cambridge University Press (1995)."},{"key":"6_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/3-540-54458-5_51","volume-title":"Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems","author":"C.P. Schnorr","year":"1991","unstructured":"Schnorr, C.P., and Euchner, M.: Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems. Proceedings of Fundamentals of Computation Theory\u2019 91, Springer Lecture Notes in Computer Science LNCS 529, pp. 68\u201385 (1991)."},{"key":"6_CR22","unstructured":"Wetzel, S.: Lattice Basis Reduction Algorithms and their Applications. PhD Thesis, Universit\u00e4t des Saarlandes, Saarbr\u00fccken, Germany (1998)."}],"container-title":["Lecture Notes in Computer Science","Algorithm Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44691-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,29]],"date-time":"2020-04-29T13:05:12Z","timestamp":1588165512000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44691-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425120","9783540446910"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-44691-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"24 August 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}