{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T08:28:39Z","timestamp":1742632119165},"reference-count":10,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,3,1]],"date-time":"2001-03-01T00:00:00Z","timestamp":983404800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4521,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,3]]},"DOI":"10.1016\/s0304-3975(00)00387-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:51:54Z","timestamp":1027619514000},"page":"641-648","source":"Crossref","is-referenced-by-count":6,"title":["On the unique shortest lattice vector problem"],"prefix":"10.1016","volume":"255","author":[{"given":"S.","family":"Ravi Kumar","sequence":"first","affiliation":[]},{"given":"D.","family":"Sivakumar","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00387-X_BIB1","doi-asserted-by":"crossref","unstructured":"M. Ajtai, The shortest vector problem in L2 is NP-hard for randomized reductions, Proc. 30th Annu. ACM Symp. on the Theory of Computing, 1998, pp. 10\u201319.","DOI":"10.1145\/276698.276705"},{"key":"10.1016\/S0304-3975(00)00387-X_BIB2","doi-asserted-by":"crossref","unstructured":"M. Ajtai, C. Dwork, A public-key cryptosystem with worst-case\/average-case equivalence, Proc. 29th Annu. ACM Symp. on the Theory of Computing, 1997, pp. 284\u2013293.","DOI":"10.1145\/258533.258604"},{"key":"10.1016\/S0304-3975(00)00387-X_BIB3","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/S0304-3975(98)00058-9","article-title":"A relation of primal\u2013dual lattices and the complexity of shortest lattice vector problem","volume":"207","author":"Cai","year":"1998","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00387-X_BIB4","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1006\/jcss.1999.1649","article-title":"Approximating the SVP to within a factor (1+1\/(dim\u03b5)) is NP-hard under randomized reductions","volume":"59","author":"Cai","year":"1999","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(00)00387-X_BIB5","doi-asserted-by":"crossref","unstructured":"J.H. Conway, N.J.A. Sloane, Sphere Packings, Lattices, and Groups, Springer, Berlin, 2nd (Ed.), 1993, 3rd (Ed.), 1998.","DOI":"10.1007\/978-1-4757-2249-9"},{"key":"10.1016\/S0304-3975(00)00387-X_BIB6","doi-asserted-by":"crossref","unstructured":"D. Micciancio, The shortest vector in a lattice is hard to approximate to within some constant, Technical Report TR 98-016, Electronic Colloq. on Computational Complexity, 1998, available at www.eccc.uni-trier.de.","DOI":"10.1109\/SFCS.1998.743432"},{"key":"10.1016\/S0304-3975(00)00387-X_BIB7","series-title":"Computational Complexity","author":"Papadimitriou","year":"1994"},{"key":"10.1016\/S0304-3975(00)00387-X_BIB8","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0097-3165(72)90019-2","article-title":"On the density of families of sets","volume":"13","author":"Sauer","year":"1972","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/S0304-3975(00)00387-X_BIB9","unstructured":"M. Sipser, Lecture notes on advanced complexity theory, MIT\/LCS course 18.405, 1996, available by anonymous ftp at theory,lcs.mit.edu\/pub\/classes\/18.405."},{"key":"10.1016\/S0304-3975(00)00387-X_BIB10","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(86)90135-0","article-title":"NP is as easy as detecting unique solutions","volume":"47","author":"Valiant","year":"1986","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750000387X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750000387X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,28]],"date-time":"2020-01-28T13:14:27Z","timestamp":1580217267000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439750000387X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3]]},"references-count":10,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,3]]}},"alternative-id":["S030439750000387X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00387-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,3]]}}}