{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:27:40Z","timestamp":1755998860318,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2018,10,24]],"date-time":"2018-10-24T00:00:00Z","timestamp":1540339200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Veni Innovational Research Grant from NWO","award":["639.021.645"],"award-info":[{"award-number":["639.021.645"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1007\/s10623-018-0573-3","type":"journal-article","created":{"date-parts":[[2018,10,23]],"date-time":"2018-10-23T23:39:40Z","timestamp":1540337980000},"page":"1737-1748","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Polynomial time bounded distance decoding near Minkowski\u2019s bound in discrete logarithm lattices"],"prefix":"10.1007","volume":"87","author":[{"given":"L\u00e9o","family":"Ducas","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5417-7133","authenticated-orcid":false,"given":"C\u00e9cile","family":"Pierrot","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,24]]},"reference":[{"key":"573_CR1","unstructured":"Ajtai M.: Generating random lattices according to the invariant distribution. Draft (2006)"},{"key":"573_CR2","unstructured":"Barbulescu R., Gaudry P., Joux A., Thom\u00e9 E.: A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic. In: Advances in Cryptology\u2014EUROCRYPT 2014\u201433rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Copenhagen, May 11\u201315, 2014. Proceedings, pp. 1\u201316 (2014)"},{"key":"573_CR3","unstructured":"Brier E., Coron J.-S., G\u00e9raud R., Maimut D., Naccache D.: A number-theoretic error-correcting code. In: Innovative Security Solutions for Information Technology and Communications\u20148th International Conference, SECITC 2015, Bucharest, June 11\u201312, 2015. Revised Selected Papers, pp. 25\u201335 (2015)"},{"key":"573_CR4","unstructured":"Chevallier-Mames B., Naccache D., Stern J.: Linear bandwidth Naccache\u2013Stern encryption. In: Security and Cryptography for Networks, 6th International Conference, SCN 2008, Amalfi, September 10\u201312, 2008. Proceedings, pp. 327\u2013339 (2008)"},{"issue":"5","key":"573_CR5","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1109\/18.21214","volume":"34","author":"B Chor","year":"1988","unstructured":"Chor B., Rivest R.L.: A knapsack-type public key cryptosystem based on arithmetic in finite fields. IEEE Trans. Inf. Theory 34(5), 901\u2013909 (1988).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"573_CR6","volume-title":"Sphere Packings, Lattices and Groups","author":"JH Conway","year":"2013","unstructured":"Conway J.H., Sloane N.J.A.: Sphere Packings, Lattices and Groups, vol. 290. Springer, New York (2013)."},{"issue":"8","key":"573_CR7","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1155\/S1073792894000395","volume":"1994","author":"ND Elkies","year":"1994","unstructured":"Elkies N.D.: Mordell\u2013Weil lattices in characteristic 2: I. construction and first properties. Int. Math. Res. Not. 1994(8), 343\u2013361 (1994).","journal-title":"Int. Math. Res. Not."},{"key":"573_CR8","doi-asserted-by":"crossref","unstructured":"Grigorescu E., Peikert C.: List decoding Barnes\u2013Wall lattices. In: IEEE 27th Annual Conference on Computational Complexity (CCC), pp. 316\u2013325. IEEE (2012)","DOI":"10.1109\/CCC.2012.33"},{"issue":"3","key":"573_CR9","doi-asserted-by":"publisher","first-page":"649","DOI":"10.2307\/1971363","volume":"126","author":"HW Lenstra","year":"1987","unstructured":"Lenstra H.W.: Factoring integers with elliptic curves. Ann. Math. 126(3), 649\u2013673 (1987).","journal-title":"Ann. Math."},{"issue":"3","key":"573_CR10","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BF00196908","volume":"3","author":"HW Lenstra","year":"1991","unstructured":"Lenstra H.W.: On the Chor\u2013Rivest knapsack cryptosystem. J. Cryptol. 3(3), 149\u2013155 (1991).","journal-title":"J. Cryptol."},{"key":"573_CR11","unstructured":"Li Z., Ling S., Xing C., Yeo S.L.: On the closest vector problem for lattices constructed from polynomials and their cryptographic applications. Cryptology ePrint Archive, Report 2017\/1002 (2017). \n                    https:\/\/eprint.iacr.org\/2017\/1002\n                    \n                  ."},{"issue":"1","key":"573_CR12","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01389902","volume":"44","author":"J Martinet","year":"1978","unstructured":"Martinet J.: Tours de corps de classes et estimations de discriminants. Invent. Math. 44(1), 65\u201373 (1978).","journal-title":"Invent. Math."},{"key":"573_CR13","unstructured":"Micciancio D., Nicolosi A.: Efficient bounded distance decoders for Barnes\u2013Wall lattices. In: IEEE International Symposium on Information Theory, 2008. ISIT 2008, pp. 2484\u20132488. IEEE (2008)"},{"key":"573_CR14","unstructured":"Naccache D., Stern J.: A new public-key cryptosystem. In: Advances in Cryptology\u2014EUROCRYPT \u201997, International Conference on the Theory and Application of Cryptographic Techniques, Konstanz, May 11\u201315, 1997, Proceeding. pp 27\u201336 (1997)"},{"key":"573_CR15","unstructured":"Okamoto T., Tanaka K., Uchiyama S.: Quantum public-key cryptosystems. In: Advances in Cryptology\u2014CRYPTO 2000, 20th Annual International Cryptology Conference, Santa Barbara, August 20\u201324, 2000, Proceedings, pp. 147\u2013165 (2000)"},{"issue":"1","key":"573_CR16","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"24","author":"Stephen\u00a0C Pohlig","year":"1978","unstructured":"Pohlig Stephen\u00a0C, Hellman Martin\u00a0E: An improved algorithm for computing logarithms over GF(p) and its cryptographic significance (corresp.). IEEE Trans. Inf. Theory 24(1), 106\u2013110 (1978).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"573_CR17","first-page":"918","volume":"32","author":"J Pollard","year":"1978","unstructured":"Pollard J.: Monte Carlo methods for index computations mod \n                    \n                      \n                    \n                    $$p$$\n                    \n                      \n                        p\n                      \n                    \n                  . Math. Comput. 32, 918\u2013924 (1978).","journal-title":"Math. Comput."},{"issue":"2","key":"573_CR18","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1109\/18.312163","volume":"40","author":"Gregory Poltyrev","year":"1994","unstructured":"Poltyrev Gregory: On coding without restrictions for the AWGN channel. IEEE Trans. Inf. Theory 40(2), 409\u2013417 (1994).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"573_CR19","unstructured":"Shanks D.: Solved and Unsolved Problems in Number Theory. New York: Chelsea, 4th ed. (1993). ISBN: 978-0828412971."},{"issue":"5","key":"573_CR20","doi-asserted-by":"publisher","first-page":"931","DOI":"10.2307\/2374791","volume":"113","author":"T Shioda","year":"1991","unstructured":"Shioda T.: Mordell\u2013Weil lattices and sphere packings. Am. J. Math. 113(5), 931\u2013948 (1991).","journal-title":"Am. J. Math."},{"key":"573_CR21","first-page":"79","volume":"46","author":"LF Toth","year":"1940","unstructured":"Toth L.F.: Uber einen geometrischen satz. Math. Z. 46, 79\u201383 (1940).","journal-title":"Math. Z."},{"key":"573_CR22","unstructured":"Yan Y., Ling L., Cong L., Xiaofu W.: Polar lattices. CoRR, construction of capacity-achieving lattice codes (2014)"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-018-0573-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-018-0573-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-018-0573-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,23]],"date-time":"2019-10-23T20:08:58Z","timestamp":1571861338000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-018-0573-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,24]]},"references-count":22,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2019,8]]}},"alternative-id":["573"],"URL":"https:\/\/doi.org\/10.1007\/s10623-018-0573-3","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2018,10,24]]},"assertion":[{"value":"1 February 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 October 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 October 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 October 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}