{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T05:45:40Z","timestamp":1769579140885,"version":"3.49.0"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032018540","type":"print"},{"value":"9783032018557","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-032-01855-7_11","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T19:41:20Z","timestamp":1755373280000},"page":"321-352","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Gaussian Sampling for\u00a0q-ary Lattices and\u00a0Linear Codes with\u00a0Lee Weight"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6195-492X","authenticated-orcid":false,"given":"Maiara F.","family":"Bollauf","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0000-7481-8233","authenticated-orcid":false,"given":"Maja","family":"Lie","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7873-4862","authenticated-orcid":false,"given":"Cong","family":"Ling","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"issue":"11","key":"11_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2020.112036","volume":"343","author":"N Abdelghany","year":"2020","unstructured":"Abdelghany, N., Wood, J.A.: Failure of the MacWilliams identities for the Lee weight enumerator over $$\\mathbb{Z} _m$$, $$m \\ge 5$$. Discret. Math. 343(11), 112036 (2020)","journal-title":"Discret. Math."},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Aggarwal, D., Dadush, D., Regev, O., Stephens-Davidowitz, N.: Solving the shortest vector problem in $$2^n$$ time using discrete Gaussian sampling: extended abstract. In: Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing \u2013 STOC 2015, pp. 733\u2013742. Association for Computing Machinery, New York (2015)","DOI":"10.1145\/2746539.2746606"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Aggarwal, D., Dadush, D., Stephens-Davidowitz, N.: Solving the closest vector problem in $$2^n$$ time \u2013 the discrete Gaussian strikes again! In: 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, pp. 563\u2013582 (2015)","DOI":"10.1109\/FOCS.2015.41"},{"issue":"1","key":"11_CR4","doi-asserted-by":"publisher","first-page":"117","DOI":"10.4153\/CJM-1983-008-1","volume":"35","author":"ES Barnes","year":"1983","unstructured":"Barnes, E.S., Sloane, N.J.A.: New lattice packings of spheres. Can. J. Math. 35(1), 117\u2013130 (1983)","journal-title":"Can. J. Math."},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Bollauf, M.F., Lie, M., Ling, C.: On Gaussian sampling for q-ary lattices and linear codes with Lee weight. Cryptology ePrint Archive, Paper 2025\/087 (2025). https:\/\/eprint.iacr.org\/2025\/087","DOI":"10.1007\/978-3-032-01855-7_11"},{"issue":"5","key":"11_CR6","doi-asserted-by":"publisher","first-page":"3309","DOI":"10.1109\/TIT.2024.3377927","volume":"70","author":"MF Bollauf","year":"2023","unstructured":"Bollauf, M.F., Lin, H.Y., Ytrehus, \u00d8.: Secrecy gain of formally unimodular lattices from codes over the integers modulo 4. IEEE Trans. Inf. Theory 70(5), 3309\u20133329 (2023)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"11_CR7","unstructured":"Borwein, J., Borwein, P.: Pi and the AGM: A Study in Analytic Number Theory and Computational Complexity. Wiley-Interscience and Canadian Mathematics Series of Monographs and Texts. Wiley, New York (1987)"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Langlois, A., Peikert, C., Regev, O., Stehl\u00e9, D.: Classical hardness of learning with errors. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing \u2013 STOC 2013, pp. 575\u2013584. Association for Computing Machinery, New York (2013)","DOI":"10.1145\/2488608.2488680"},{"key":"11_CR9","unstructured":"Campello, A., Belfiore, J.: Sampling algorithms for lattice Gaussian codes. In: 24th International Zurich Seminar on Communications, pp. 165\u2013169 (2016)"},{"key":"11_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-6568-7","volume-title":"Sphere Packings, Lattices and Groups","author":"J Conway","year":"1999","unstructured":"Conway, J., Sloane, N.: Sphere Packings, Lattices and Groups, 3rd edn. Springer, New York (1999)","edition":"3"},{"key":"11_CR11","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/978-3-031-07082-2_23","volume-title":"EUROCRYPT 2022","author":"L Ducas","year":"2022","unstructured":"Ducas, L., van Woerden, W.: On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022. LNCS, vol. 13277, pp. 643\u2013673. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07082-2_23"},{"issue":"5","key":"11_CR12","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1155\/S1073792893000121","volume":"1993","author":"W Duke","year":"1993","unstructured":"Duke, W.: On codes and Siegel modular forms. Int. Math. Res. Not. 1993(5), 125\u2013136 (1993)","journal-title":"Int. Math. Res. Not."},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-981-99-8739-9_3","volume-title":"Advances in Cryptology - ASIACRYPT 2023","author":"T Espitau","year":"2023","unstructured":"Espitau, T., Wallet, A., Yu, Y.: On Gaussian sampling, smoothing parameter and application to lattice signatures. In: Guo, J., Steinfeld, R. (eds.) Advances in Cryptology - ASIACRYPT 2023, pp. 65\u201397. Springer, Singapore (2023)"},{"issue":"5","key":"11_CR14","doi-asserted-by":"publisher","first-page":"1123","DOI":"10.1109\/18.21245","volume":"34","author":"D Forney","year":"1989","unstructured":"Forney, D.: Coset codes I: introduction and geometrical classification. IEEE Trans. Inf. Theory 34(5), 1123\u20131151 (1989)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing \u2013 STOC 2008, pp. 197\u2013206. Association for Computing Machinery, New York (2008)","DOI":"10.1145\/1374376.1374407"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Harshan, J., Viterbo, E., Belfiore, J.: Construction of Barnes-Wall lattices from linear codes over rings. In: 2012 IEEE International Symposium on Information Theory, pp. 3110\u20133114. IEEE (2012)","DOI":"10.1109\/ISIT.2012.6284136"},{"key":"11_CR17","unstructured":"Horlemann, A.L., Khathuria, K., Newman, M., Sakzad, A., Cabello, C.V.: Lattice-based vulnerabilities in Lee metric post-quantum cryptosystems. Cryptology ePrint Archive, Paper 2024\/1495 (2024). https:\/\/eprint.iacr.org\/2024\/1495"},{"key":"11_CR18","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-031-68391-6_8","volume-title":"CRYPTO 2024","author":"F H\u00f6rmann","year":"2024","unstructured":"H\u00f6rmann, F., van Woerden, W.: FuLeakage: breaking FuLeeca by learning attacks. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024. LNCS, vol. 14925, pp. 253\u2013286. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68391-6_8"},{"key":"11_CR19","doi-asserted-by":"publisher","first-page":"1068","DOI":"10.1112\/jlms.12298","volume":"101","author":"S Hu","year":"2018","unstructured":"Hu, S., Nebe, G.: Strongly perfect lattices sandwiched between Barnes-Wall lattices. J. Lond. Math. Soc. 101, 1068\u20131089 (2018)","journal-title":"J. Lond. Math. Soc."},{"key":"11_CR20","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/s10623-014-9939-3","volume":"73","author":"W Kositwattanarerk","year":"2013","unstructured":"Kositwattanarerk, W., Oggier, F.E.: Connections between Construction D and related constructions of lattices. Des. Codes Crypt. 73, 441\u2013455 (2013)","journal-title":"Des. Codes Crypt."},{"issue":"10","key":"11_CR21","doi-asserted-by":"publisher","first-page":"5918","DOI":"10.1109\/TIT.2014.2332343","volume":"60","author":"C Ling","year":"2014","unstructured":"Ling, C., Belfiore, J.C.: Achieving AWGN channel capacity with lattice Gaussian coding. IEEE Trans. Inf. Theory 60(10), 5918\u20135929 (2014)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"11_CR22","doi-asserted-by":"publisher","first-page":"6399","DOI":"10.1109\/TIT.2014.2343226","volume":"60","author":"C Ling","year":"2014","unstructured":"Ling, C., Luzzi, L., Belfiore, J.C., Stehl\u00e9, D.: Semantically secure lattice codes for the Gaussian wiretap channel. IEEE Trans. Inf. Theory 60(10), 6399\u20136416 (2014)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"11_CR23","volume-title":"The Theory of Error-Correcting Codes","author":"FJ MacWilliams","year":"1977","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1977)"},{"issue":"4","key":"11_CR24","doi-asserted-by":"publisher","first-page":"738","DOI":"10.4153\/CJM-1978-063-3","volume":"30","author":"DP Maher","year":"1978","unstructured":"Maher, D.P.: Lee polynomials of codes and theta functions of lattices. Can. J. Math. 30(4), 738\u2013747 (1978)","journal-title":"Can. J. Math."},{"key":"11_CR25","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Nicolosi, A.: Efficient bounded distance decoders for Barnes-Wall lattices. In: 2008 IEEE International Symposium on Information Theory, pp. 2484\u20132488 (2008)","DOI":"10.1109\/ISIT.2008.4595438"},{"issue":"1","key":"11_CR26","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1137\/S0097539705447360","volume":"37","author":"D Micciancio","year":"2007","unstructured":"Micciancio, D., Regev, O.: Worst-case to average-case reductions based on Gaussian measures. SIAM J. Comput. 37(1), 267\u2013302 (2007)","journal-title":"SIAM J. Comput."},{"key":"11_CR27","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Regev, O.: Lattice-Based Cryptography, pp. 147\u2013191. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-540-88702-7_5"},{"key":"11_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/978-3-319-63715-0_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"D Micciancio","year":"2017","unstructured":"Micciancio, D., Walter, M.: Gaussian sampling over the integers: efficient, generic, constant-time. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10402, pp. 455\u2013485. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_16"},{"key":"11_CR29","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1109\/TIT.2021.3126540","volume":"68","author":"E Mook","year":"2020","unstructured":"Mook, E., Peikert, C.: Lattice (list) decoding near Minkowski\u2019s inequality. IEEE Trans. Inf. Theory 68, 863\u2013870 (2020)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"11_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-642-14623-7_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"C Peikert","year":"2010","unstructured":"Peikert, C.: An efficient and parallel gaussian sampler for lattices. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 80\u201397. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_5"},{"key":"11_CR31","doi-asserted-by":"crossref","unstructured":"Regev, O., Stephens-Davidowitz, N.: A reverse Minkowski theorem. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing \u2013 STOC 2017, pp. 941\u2013953. Association for Computing Machinery, New York (2017)","DOI":"10.1145\/3055399.3055434"},{"key":"11_CR32","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-031-46495-9_4","volume-title":"Code-Based Cryptography","author":"S Ritterhoff","year":"2023","unstructured":"Ritterhoff, S., et al.: FuLeeca: a Lee-based signature scheme. In: Esser, A., Santini, P. (eds.) Code-Based Cryptography, pp. 56\u201383. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-46495-9_4"},{"issue":"2","key":"11_CR33","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.jco.2003.08.020","volume":"20","author":"IE Shparlinski","year":"2004","unstructured":"Shparlinski, I.E., Steinfeld, R.: Noisy Chinese remaindering in the Lee norm. J. Complex. 20(2), 423\u2013437 (2004)","journal-title":"J. Complex."},{"key":"11_CR34","unstructured":"The Sage Developers: SageMath, the Sage Mathematics Software System (2022). https:\/\/www.sagemath.org"},{"key":"11_CR35","doi-asserted-by":"publisher","DOI":"10.1142\/3603","volume-title":"Quaternary Codes","author":"ZX Wan","year":"1997","unstructured":"Wan, Z.X.: Quaternary Codes. World Scientific, Singapore (1997)"},{"issue":"1","key":"11_CR36","doi-asserted-by":"publisher","first-page":"233","DOI":"10.3934\/amc.2022029","volume":"18","author":"V Weger","year":"2024","unstructured":"Weger, V., Khathuria, K., Horlemann, A.L., Battaglioni, M., Santini, P., Persichetti, E.: On the hardness of the Lee syndrome decoding problem. Adv. Math. Commun. 18(1), 233\u2013266 (2024)","journal-title":"Adv. Math. Commun."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01855-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T13:29:12Z","timestamp":1769520552000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01855-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032018540","9783032018557"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01855-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"17 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}