{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T19:13:20Z","timestamp":1676056400614},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540424888","type":"print"},{"value":"9783540446705","type":"electronic"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44670-2_1","type":"book-chapter","created":{"date-parts":[[2007,5,7]],"date-time":"2007-05-07T08:45:28Z","timestamp":1178527528000},"page":"1-3","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An Overview of the Sieve Algorithm for the Shortest Lattice Vector Problem"],"prefix":"10.1007","author":[{"given":"Mikl\u00f3s","family":"Ajtai","sequence":"first","affiliation":[]},{"given":"Ravi","family":"Kumar","sequence":"additional","affiliation":[]},{"given":"Dandapani","family":"Sivakumar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,9,17]]},"reference":[{"key":"1_CR1","unstructured":"M. Ajtai. The shortest vector problem in L\n \n 2\n is NP-hard for randomized reductions. Proc. 30th ACM Symposium on Theory of Computing, pp. 10\u201319, 1998."},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"M. Ajtai, R. Kumar, and D. Sivakumar. A sieve algorithm for the shortest lattice vector problem. Proc. 33rd ACM Symposium on Theory of Computing, 2001. To appear.","DOI":"10.1145\/380752.380857"},{"key":"1_CR3","unstructured":"P. van Emde Boas. Another NP-complete partition problem and the complexity of computing short vectors in lattices. Mathematics Department, University of Amsterdam, TR 81-04, 1981."},{"key":"1_CR4","unstructured":"C. F. Gauss. Disquisitiones Arithmeticae. English edition, (Translated by A. A. Clarke) Springer-Verlag, 1966."},{"issue":"3","key":"1_CR5","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1006\/jcss.1999.1686","volume":"60","author":"O. Goldreich","year":"2000","unstructured":"O. Goldreich and S. Goldwasser. On the limits of nonapproximability of lattice problems. Journal of Computer and System Sciences, 60(3):540\u2013563, 2000.","journal-title":"Journal of Computer and System Sciences"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0304-3975(85)90067-2","volume":"41","author":"B. Helfrich","year":"1985","unstructured":"B. Helfrich. Algorithms to construct Minkowski reduced and Hermite reduced bases. Theoretical Computer Science, 41:125\u2013139, 1985.","journal-title":"Theoretical Computer Science"},{"key":"1_CR7","first-page":"122","volume":"40","author":"C. Hermite","year":"1905","unstructured":"C. Hermite. Second letter to Jacobi, Oeuvres, I, Journal f\u00fcr Mathematik, 40:122\u2013135, 1905.","journal-title":"Journal f\u00fcr Mathematik"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1287\/moor.12.3.415","volume":"12","author":"R. Kannan","year":"1987","unstructured":"R. Kannan. Minkowski\u2019s convex body theorem and integer programming. Mathematics of Operations Research, 12:415\u2013440, 1987. Preliminary version in ACM Symposium on Theory of Computing 1983.","journal-title":"Mathematics of Operations Research"},{"key":"1_CR9","unstructured":"R. Kumar and D. Sivakumar. On polynomial approximations to the shortest lattice vector length. Proc. 12th Symposium on Discrete Algorithms, 2001."},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A. K. Lenstra","year":"1982","unstructured":"A. K. Lenstra, H. W. Lenstra, and L. Lov\u00e1sz. Factoring polynomials with rational coefficients. Mathematische Annalen, 261:515\u2013534, 1982.","journal-title":"Mathematische Annalen"},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/BF02128669","volume":"10","author":"J. C. Lagarias","year":"1990","unstructured":"J. C. Lagarias, H. W. Lenstra, and C. P. Schnorr. Korkine-Zolotarev bases and successive minima of a lattice and its reciprocal lattice. Combinatorica, 10:333\u2013348, 1990.","journal-title":"Combinatorica"},{"key":"1_CR12","unstructured":"D. Micciancio. The shortest vector in a lattice is hard to approximate to within some constant. Proc. 39th IEEE Symposium on Foundations of Computer Science, pp. 92\u201398, 1998."},{"key":"1_CR13","unstructured":"H. Minkowski. Geometrie der Zahlen. Leipzig, Teubner, 1990."},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-3975(87)90064-8","volume":"53","author":"C. P. Schnorr","year":"1987","unstructured":"C. P. Schnorr. A hierarchy of polynomial time basis reduction algorithms. Theoretical Computer Science, 53:201\u2013224, 1987.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Cryptography and Lattices"],"original-title":[],"link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44670-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T18:40:36Z","timestamp":1676054436000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-44670-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424888","9783540446705"],"references-count":14,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-44670-2_1","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"published":{"date-parts":[[2001]]},"assertion":[{"value":"17 September 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}