{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T07:38:24Z","timestamp":1776757104419,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540167617","type":"print"},{"value":"9783540398592","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/3-540-16761-7_85","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:52:15Z","timestamp":1330195935000},"page":"359-369","source":"Crossref","is-referenced-by-count":7,"title":["A more efficient algorithm for lattice basis reduction"],"prefix":"10.1007","author":[{"given":"C. P.","family":"Schnorr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"37_CR1","doi-asserted-by":"crossref","unstructured":"L. Adleman: On breaking the iterated Merkle-Hellman public key cryptosystem. Proc. 15th ACM Symp. on theory of Computing (1983), 402\u2013412.","DOI":"10.1007\/978-1-4757-0602-4_29"},{"key":"37_CR2","doi-asserted-by":"crossref","unstructured":"A.M.Frieze, R. Kannan and J.C. Lagarias: Linear congruential generators do not produce random sequences. Proc. 25th IEEE Symp. on Theory of Computing (1984) 480\u2013484.","DOI":"10.1109\/SFCS.1984.715950"},{"key":"37_CR3","doi-asserted-by":"crossref","unstructured":"J. Hastad and A. Shamir: The cryptographic security of truncated linearly related variables. Proc. 17th ACM Symp. on Theory of Computing (1985), 356\u2013362.","DOI":"10.1145\/22145.22184"},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"J. Hastad, B. Helfrich, J.C.Lagarias and C.P.Schnorr: Polynomial time algorithms for finding integer relations among real numbers. Proceedings of STACS 86, 3rd Symposium on Theoretical Aspects of Computer Science, Jan. 1986, Orsay, Springer Lecture Notes in Computer Science.","DOI":"10.1007\/3-540-16078-7_69"},{"key":"37_CR5","unstructured":"E. Kaltofen: On the complexity of finding short vectors in integer lattices. Proc. Eurocal'83. Lecture Notes in Comp. Sci."},{"key":"37_CR6","doi-asserted-by":"crossref","unstructured":"J.C.Lagarias: The computational complexity of simultaneous diophantine approximation problems. Proc. 23d IEEE Symp. on Foundations of Computer Science (1983), 32\u201339.","DOI":"10.1109\/SFCS.1982.43"},{"key":"37_CR7","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A.K. Lenstra","year":"1982","unstructured":"A.K. Lenstra, H.W. Lenstra Jr., L. Lov\u00e0sz: Factoring polynomials with rational coefficients. Math. Ann. 261 (1982), 515\u2013534.","journal-title":"Math. Ann."},{"key":"37_CR8","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H.W. Lenstra Jr.","year":"1983","unstructured":"H.W. Lenstra, Jr.: Integer programming in a fixed number of variables. Mathematics of Operations Research 8 (1983) 538\u2013548.","journal-title":"Mathematics of Operations Research"},{"key":"37_CR9","unstructured":"A. M.Odlyzko and H. te Riele: Disproof of the Mertens conjecture. Preprint 1984."},{"key":"37_CR10","unstructured":"C.P.Schnorr: A hierarchy of polynomial time lattice basis reduction algorithms. Extended abstract in: Theory of Algebra, Colloquia Mathematica Societatis Janos Bolyai 44 (North-Holland, Amsterdam, 1986) Complete paper is submitted for publication."},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"A.Sch\u00f6nhage: Factorization of univariate integer polynomials by diophantine approximation and an improved basis reduction algorithm. Proc. ICALP (1984) Antwerpen.","DOI":"10.1007\/3-540-13345-3_40"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16761-7_85.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:10:58Z","timestamp":1605643858000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16761-7_85"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540167617","9783540398592"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-16761-7_85","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986]]}}}