{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T06:10:45Z","timestamp":1673158245473},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,10,19]],"date-time":"2022-10-19T00:00:00Z","timestamp":1666137600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,19]],"date-time":"2022-10-19T00:00:00Z","timestamp":1666137600000},"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":["SN COMPUT. SCI."],"DOI":"10.1007\/s42979-022-01440-2","type":"journal-article","created":{"date-parts":[[2022,10,19]],"date-time":"2022-10-19T08:03:14Z","timestamp":1666166594000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Polynomial Algorithm for Solving the Closest Vector Problem in Tensored Root Lattices of Type D"],"prefix":"10.1007","volume":"4","author":[{"given":"Arnaud Gir\u00e8s Fobasso","family":"Tchinda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emmanuel","family":"Fouotsa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Celestin Nkuimi","family":"Jugnia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,19]]},"reference":[{"key":"1440_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal D, Dadush D, Stephens-Davidowitz N. Solving the closest vector problem in $$2^{\\rm n}$$ time: the discrete gaussian strikes again! In: Guruswami V, editor. IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015. IEEE Computer Society; 2015. p. 563\u2013582.","DOI":"10.1109\/FOCS.2015.41"},{"key":"1440_CR2","volume-title":"Network flows-theory, algorithms and applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja RK, Magnanti TL, Orlin JB. Network flows-theory, algorithms and applications. Hoboken: Prentice Hall; 1993."},{"issue":"2","key":"1440_CR3","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1109\/TIT.1982.1056484","volume":"28","author":"JH Conway","year":"1982","unstructured":"Conway JH, Sloane NJA. Fast quantizing and decoding and algorithms for lattice quantizers and codes. IEEE Trans Inf Theory. 1982;28(2):227\u201331.","journal-title":"IEEE Trans Inf Theory"},{"key":"1440_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2016-7","volume-title":"Sphere Packings, Lattices and Groups, volume 290 of Grundlehren der mathematischen Wissenschaften","author":"JH Conway","year":"1988","unstructured":"Conway JH, Sloane NJA. Sphere Packings, Lattices and Groups, volume 290 of Grundlehren der mathematischen Wissenschaften. Berlin: Springer; 1988."},{"key":"1440_CR5","doi-asserted-by":"crossref","unstructured":"Dachman-Soled D, Ducas L, Gong H, Rossi M. LWE with side information: attacks and concrete security estimation. In: Micciancio D, Ristenpart T, editors. Advances in Cryptology-CRYPTO 2020-40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17-21, 2020, Proceedings, Part II, volume 12171 of Lecture Notes in Computer Science. Springer; 2020. p. 329\u2013358.","DOI":"10.1007\/978-3-030-56880-1_12"},{"key":"1440_CR6","doi-asserted-by":"crossref","unstructured":"Ducas L. Shortest vector from lattice sieving: a few dimensions for free. In: Nielsen JB, Rijmen V, editors. Advances in Cryptology-EUROCRYPT 2018-37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29-May 3, 2018 Proceedings, Part I, volume 10820 of Lecture Notes in Computer Science. Springer; 2018. p. 125\u2013145.","DOI":"10.1007\/978-3-319-78381-9_5"},{"issue":"1","key":"1440_CR7","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s10623-017-0332-x","volume":"86","author":"L Ducas","year":"2018","unstructured":"Ducas L, van Woerden WPJ. The closest vector problem in tensored root lattices of type A and in their duals. Des Codes Cryptogr. 2018;86(1):137\u201350.","journal-title":"Des Codes Cryptogr"},{"key":"1440_CR8","doi-asserted-by":"crossref","unstructured":"Ducas L, van Woerden WPJ. On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography. In: Dunkelman O, Dziembowski S, editors. Advances in Cryptology-EUROCRYPT 2022-41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30-June 3, 2022, Proceedings, Part III, volume 13277 of Lecture Notes in Computer Science. Springer; 2022. p. 643\u2013673.","DOI":"10.1007\/978-3-031-07082-2_23"},{"issue":"4","key":"1440_CR9","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1109\/TIT.1979.1056067","volume":"25","author":"A Gersho","year":"1979","unstructured":"Gersho A. Asymptotically optimal block quantization. IEEE Trans Inf Theory. 1979;25(4):373\u201380.","journal-title":"IEEE Trans Inf Theory"},{"key":"1440_CR10","doi-asserted-by":"crossref","unstructured":"Goldreich O, Goldwasser S, Halevi S. Public-key cryptosystems from lattice reduction problems. In: Kaliski Jr BS, editor. Advances in Cryptology-CRYPTO \u201997, 17th Annual International Cryptology Conference, Santa Barbara, California, USA, August 17\u201321, 1997, Proceedings, volume 1294 of Lecture Notes in Computer Science. Springer; 1997. p. 112\u2013131.","DOI":"10.1007\/BFb0052231"},{"key":"1440_CR11","doi-asserted-by":"crossref","unstructured":"Lyubashevsky V, Peikert C, Regev O. On ideal lattices and learning with errors over rings. In: Gilbert H, editor. Advances in Cryptology-EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco\/French Riviera, May 30-June 3, 2010. Proceedings, volume 6110 of Lecture Notes in Computer Science. Springer; 2010. p. 1\u201323.","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"1440_CR12","first-page":"293","volume":"2013","author":"V Lyubashevsky","year":"2013","unstructured":"Lyubashevsky V, Peikert C, Regev O. A toolkit for ring-lwe cryptography. IACR Cryptol ePrint Arch. 2013;2013:293.","journal-title":"IACR Cryptol ePrint Arch"},{"key":"1440_CR13","doi-asserted-by":"crossref","unstructured":"Micciancio D, Voulgaris P. A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations. In: Schulman LJ, editor. Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010. ACM; 2010. p. 351\u2013358.","DOI":"10.1145\/1806689.1806739"},{"issue":"5","key":"1440_CR14","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor PW. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J Comput. 1997;26(5):1484\u2013509.","journal-title":"SIAM J Comput"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-022-01440-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-022-01440-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-022-01440-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T22:18:13Z","timestamp":1673129893000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-022-01440-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,19]]},"references-count":14,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,1]]}},"alternative-id":["1440"],"URL":"https:\/\/doi.org\/10.1007\/s42979-022-01440-2","relation":{},"ISSN":["2661-8907"],"issn-type":[{"value":"2661-8907","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,19]]},"assertion":[{"value":"4 December 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 October 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 October 2022","order":3,"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":"19"}}