{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:48:32Z","timestamp":1720640912892},"reference-count":9,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1016\/j.endm.2019.02.002","type":"journal-article","created":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T17:58:28Z","timestamp":1553104708000},"page":"9-14","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Minimal condition for shortest vectors in lattices of low dimension"],"prefix":"10.1016","volume":"71","author":[{"given":"Juhee","family":"Lee","sequence":"first","affiliation":[]},{"given":"Seunghwan","family":"Chang","sequence":"additional","affiliation":[]},{"given":"Taewan","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Hyang-Sook","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Seongan","family":"Lim","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.endm.2019.02.002_br0010","doi-asserted-by":"crossref","unstructured":"M. Ajtai, Generating hard instances of lattice problems, in: Proceedings of the 28th annual ACM symposium on theory of computing (STOC 1996), pp. 99\u2013108.","DOI":"10.1145\/237814.237838"},{"key":"10.1016\/j.endm.2019.02.002_br0020","doi-asserted-by":"crossref","unstructured":"M. Ajtai, The shortest vector problem in L2 is NP-hard for randomized reductions, in: Proceedings of the 30th annual ACM symposium on theory of computing (STOC 1998), pp. 10\u201319.","DOI":"10.1145\/276698.276705"},{"key":"10.1016\/j.endm.2019.02.002_br0030","author":"Chang"},{"key":"10.1016\/j.endm.2019.02.002_br0040","doi-asserted-by":"crossref","unstructured":"C. Gentry, C. Peikert, V. Vaikuntanathan, Trapdoors for hard lattices and new cryptographic constructions, in: Proceedings of the 40th annual ACM symposium on theory of computing (STOC 2008), pp. 197\u2013206.","DOI":"10.1145\/1374376.1374407"},{"key":"10.1016\/j.endm.2019.02.002_br0050","series-title":"Advances in cryptology\u2013EUROCRYPT 2012","first-page":"738","article-title":"Lattice signatures without trapdoors","volume":"vol. 7237","author":"Lyubashevsky","year":"2012"},{"key":"10.1016\/j.endm.2019.02.002_br0060","doi-asserted-by":"crossref","DOI":"10.1145\/1597036.1597050","article-title":"Low-dimensional lattice basis reduction revisited","volume":"5","author":"Nguyen","year":"2009","journal-title":"ACM Trans. Algorithms"},{"key":"10.1016\/j.endm.2019.02.002_br0070","doi-asserted-by":"crossref","unstructured":"C. Peikert, Public-key cryptosystems from the worst-case shortest vector problem, in: Proceedings of the 41st annual ACM symposium on theory of computing (STOC 2009), pp. 333\u2013342.","DOI":"10.1145\/1536414.1536461"},{"key":"10.1016\/j.endm.2019.02.002_br0080","doi-asserted-by":"crossref","unstructured":"O. Regev, On lattices, learning with errors, random linear codes, and cryptography, in: Proceedings of the 37th annual ACM symposium on theory of computing (STOC 2005), pp. 84\u201393.","DOI":"10.1145\/1060590.1060603"},{"key":"10.1016\/j.endm.2019.02.002_br0090","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/3-540-44670-2_13","article-title":"A 3-dimensional lattice reduction algorithm, Cryptography and lattices","volume":"2146","author":"Semaev","year":"2001","journal-title":"Lecture Notes in Comput. Sci."}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065319300022?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065319300022?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,11,21]],"date-time":"2019-11-21T23:48:22Z","timestamp":1574380102000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065319300022"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3]]},"references-count":9,"alternative-id":["S1571065319300022"],"URL":"https:\/\/doi.org\/10.1016\/j.endm.2019.02.002","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2019,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Minimal condition for shortest vectors in lattices of low dimension","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.endm.2019.02.002","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}