{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:41Z","timestamp":1740122441760,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61602143"],"award-info":[{"award-number":["61602143"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1007\/s10878-024-01183-1","type":"journal-article","created":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T13:01:51Z","timestamp":1717246911000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the SVP for low-dimensional circulant lattices"],"prefix":"10.1007","volume":"47","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3061-2388","authenticated-orcid":false,"given":"Gengran","family":"Hu","sequence":"first","affiliation":[]},{"given":"Yanbin","family":"Pan","sequence":"additional","affiliation":[]},{"given":"Renzhang","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,6,1]]},"reference":[{"key":"1183_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai M (1998) The shortest vector problem in l2 is np-hard for randomized reductions. In: Proceedings of the thirtieth annual ACM symposium on theory of computing, pp 10\u201319","DOI":"10.1145\/276698.276705"},{"key":"1183_CR2","doi-asserted-by":"crossref","unstructured":"Ajtai M, Dwork C (1997) A public-key cryptosystem with worst-case\/average-case equivalence. In: Proceedings of the twenty-ninth annual ACM symposium on theory of computing, pp 284\u2013293","DOI":"10.1145\/258533.258604"},{"key":"1183_CR3","doi-asserted-by":"crossref","unstructured":"Ajtai M, Kumar R, Sivakumar D (2001) A sieve algorithm for the shortest lattice vector problem. In: Proceedings of the thirty-third annual ACM symposium on theory of computing, pp 601\u2013610","DOI":"10.1145\/380752.380857"},{"key":"1183_CR4","doi-asserted-by":"crossref","unstructured":"Aono Y, Nguyen PQ (2017) Random sampling revisited: lattice enumeration with discrete pruning. In: Advances in cryptology\u2013EUROCRYPT 2017: 36th Annual international conference on the theory and applications of cryptographic techniques, Paris, France, April 30\u2013May 4, 2017, Proceedings, Part II 36, Springer, pp 65\u2013102","DOI":"10.1007\/978-3-319-56614-6_3"},{"issue":"3","key":"1183_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2633600","volume":"6","author":"Z Brakerski","year":"2014","unstructured":"Brakerski Z, Gentry C, Vaikuntanathan V (2014) (Leveled) fully homomorphic encryption without bootstrapping. ACM Trans Comput Theory (TOCT) 6(3):1\u201336","journal-title":"ACM Trans Comput Theory (TOCT)"},{"key":"1183_CR6","doi-asserted-by":"crossref","unstructured":"Doulgerakis E, Laarhoven T, de\u00a0Weger B (2020) Sieve, enumerate, slice, and lift: hybrid lattice algorithms for SVP via CVPP. In: International conference on cryptology in Africa, Springer, pp 301\u2013320","DOI":"10.1007\/978-3-030-51938-4_15"},{"key":"1183_CR7","doi-asserted-by":"crossref","unstructured":"Gentry C (2009) Fully homomorphic encryption using ideal lattices. In: Proceedings of the forty-first annual ACM symposium on theory of computing, pp 169\u2013178","DOI":"10.1145\/1536414.1536440"},{"key":"1183_CR8","doi-asserted-by":"crossref","unstructured":"Gentry C, Peikert C, Vaikuntanathan V (2008) Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of the fortieth annual ACM symposium on theory of computing, pp 197\u2013206","DOI":"10.1145\/1374376.1374407"},{"key":"1183_CR9","doi-asserted-by":"crossref","unstructured":"Hoffstein J, Pipher J, Silverman JH (1998) Ntru: A ring-based public key cryptosystem. In: International algorithmic number theory symposium, Springer, pp 267\u2013288","DOI":"10.1007\/BFb0054868"},{"key":"1183_CR10","doi-asserted-by":"crossref","unstructured":"Kannan R (1983) Improved algorithms for integer programming and related lattice problems. In: Proceedings of the fifteenth annual ACM symposium on theory of computing, pp 193\u2013206","DOI":"10.1145\/800061.808749"},{"key":"1183_CR11","doi-asserted-by":"crossref","unstructured":"Laarhoven T (2019) Evolutionary techniques in lattice sieving algorithms. In: 11th International joint conference on computational intelligence, IJCCI 2019, SciTePress Digital Library, pp 31\u201339","DOI":"10.5220\/0007968800310039"},{"key":"1183_CR12","unstructured":"Lagrange JL (1773) Recherches d\u2019arithm\u00e9tique"},{"key":"1183_CR13","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra AK, Lenstra HW, Lov\u00e1sz L (1982) Factoring polynomials with rational coefficients. Math Ann 261:515\u2013534","journal-title":"Math Ann"},{"key":"1183_CR14","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s00037-007-0234-9","volume":"16","author":"D Micciancio","year":"2007","unstructured":"Micciancio D (2007) Generalized compact knapsacks, cyclic lattices, and efficient one-way functions. Comput Complex 16:365\u2013411","journal-title":"Comput Complex"},{"issue":"1","key":"1183_CR15","doi-asserted-by":"publisher","first-page":"487","DOI":"10.4086\/toc.2012.v008a022","volume":"8","author":"D Micciancio","year":"2012","unstructured":"Micciancio D (2012) Inapproximability of the shortest vector problem: toward a deterministic reduction. Theory Comput 8(1):487\u2013512","journal-title":"Theory Comput"},{"key":"1183_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0897-7","volume-title":"Complexity of lattice problems: a cryptographic perspective","author":"D Micciancio","year":"2002","unstructured":"Micciancio D, Goldwasser S (2002) Complexity of lattice problems: a cryptographic perspective, vol 671. Springer Science & Business Media, Boston"},{"key":"1183_CR17","volume-title":"Geometrie der zahlen","author":"H Minkowski","year":"1910","unstructured":"Minkowski H (1910) Geometrie der zahlen, vol 1. BG Teubner, Leipzig"},{"key":"1183_CR18","doi-asserted-by":"crossref","unstructured":"Nguyen PQ, Stehl\u00e9 D (2006) Lll on the average. In: Algorithmic number theory: 7th international symposium, ANTS-VII, Berlin, Germany, July 23\u201328, 2006. Proceedings 7, Springer, pp 238\u2013256","DOI":"10.1007\/11792086_18"},{"issue":"4","key":"1183_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1597036.1597050","volume":"5","author":"PQ Nguyen","year":"2009","unstructured":"Nguyen PQ, Stehl\u00e9 D (2009) Low-dimensional lattice basis reduction revisited. ACM Trans Algorithms (TALG) 5(4):1\u201348","journal-title":"ACM Trans Algorithms (TALG)"},{"issue":"2","key":"1183_CR20","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1515\/JMC.2008.009","volume":"2","author":"PQ Nguyen","year":"2008","unstructured":"Nguyen PQ, Vidick T (2008) Sieve algorithms for the shortest vector problem are practical. J Math Cryptol 2(2):181\u2013207","journal-title":"J Math Cryptol"},{"key":"1183_CR21","unstructured":"NIST (2021) Post-quantum cryptography(pqc), round 3 submissions. https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/post-quantum-cryptography-standardization\/round-3-submissions"},{"key":"1183_CR22","unstructured":"Regev O (2004) Lattices in computer science. Lecture notes of a course given in Tel Aviv University"},{"issue":"6","key":"1183_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev O (2009) On lattices, learning with errors, random linear codes, and cryptography. J ACM (JACM) 56(6):1\u201340","journal-title":"J ACM (JACM)"},{"key":"1183_CR24","unstructured":"Shoup V (2001) NTL: a library for doing number theory. https:\/\/libntl.org"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01183-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01183-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01183-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T14:41:54Z","timestamp":1721659314000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01183-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,1]]},"references-count":24,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["1183"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01183-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2024,6,1]]},"assertion":[{"value":"15 May 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 June 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"81"}}