{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T16:52:57Z","timestamp":1779900777400,"version":"3.53.1"},"publisher-location":"Singapore","reference-count":31,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819987382","type":"print"},{"value":"9789819987399","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-981-99-8739-9_3","type":"book-chapter","created":{"date-parts":[[2023,12,17]],"date-time":"2023-12-17T06:01:54Z","timestamp":1702792914000},"page":"65-97","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["On Gaussian Sampling, Smoothing Parameter and\u00a0Application to\u00a0Signatures"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7655-9594","authenticated-orcid":false,"given":"Thomas","family":"Espitau","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0492-2435","authenticated-orcid":false,"given":"Alexandre","family":"Wallet","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0120-0648","authenticated-orcid":false,"given":"Yang","family":"Yu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,12,18]]},"reference":[{"key":"3_CR1","unstructured":"Aggarwal, D., Stephens-Davidowitz, N.: Just take the average! an embarrassingly simple 2$$\\hat{\\,}$$ n-time algorithm for SVP (and CVP). In: 1st Symposium on Simplicity in Algorithms (SOSA 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018)"},{"key":"3_CR2","series-title":"Part I, volume 10401 of LNCS","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-63688-7_1","volume-title":"CRYPTO 2017","author":"S Agrawal","year":"2017","unstructured":"Agrawal, S.: Stronger security for reusable garbled circuits, general definitions and attacks. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. Part I, volume 10401 of LNCS, pp. 3\u201335. Springer, Heidelberg (2017)"},{"issue":"1","key":"3_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579403","volume":"6","author":"L Babai","year":"1986","unstructured":"Babai, L.: On lovasz\u2019 lattice reduction and the nearest lattice point problem. Combinatorica 6(1), 1\u201313 (1986)","journal-title":"Combinatorica"},{"issue":"1","key":"3_CR4","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/s00145-019-09319-x","volume":"33","author":"I Chillotti","year":"2020","unstructured":"Chillotti, I., Gama, N., Georgieva, M., Izabach\u00e8ne, M.: TFHE: fast fully homomorphic encryption over the torus. J. Cryptol. 33(1), 34\u201391 (2020)","journal-title":"J. Cryptol."},{"issue":"2","key":"3_CR5","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1109\/TIT.1982.1056484","volume":"28","author":"J Conway","year":"1982","unstructured":"Conway, J., Sloane, N.: Fast quantizing and decoding and algorithms for lattice quantizers and codes. IEEE Trans. Inf. Theory 28(2), 227\u2013232 (1982)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"3_CR6","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1109\/TIT.1983.1056761","volume":"29","author":"J Conway","year":"1983","unstructured":"Conway, J., Sloane, N.: A fast encoding method for lattice codes and quantizers. IEEE Trans. Inf. Theory 29(6), 820\u2013824 (1983)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3_CR7","doi-asserted-by":"publisher","unstructured":"Conway, J., Sloane, N.J.A.: Sphere Packings, Lattices and Groups. Grundlehren der Mathematischen Wissenschaften 290. Springer-Verlag, New York (1988). https:\/\/doi.org\/10.1007\/978-1-4757-6568-7","DOI":"10.1007\/978-1-4757-6568-7"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"2961","DOI":"10.1109\/TIT.2022.3148196","volume":"68","author":"V Corlay","year":"2022","unstructured":"Corlay, V., Boutros, J.J., Ciblat, P., Brunel, L.: On the decoding of lattices constructed via a single parity check. IEEE Trans. Inf. Theory 68, 2961\u20132963 (2022)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"L\u00e9o Ducas, E.K., et al.: CRYSTALS-dilithium: a lattice-based digital signature scheme. IACR TCHES. 2018(1), 238\u2013268 (2018). https:\/\/tches.iacr.org\/index.php\/TCHES\/article\/view\/839","DOI":"10.46586\/tches.v2018.i1.238-268"},{"key":"3_CR10","series-title":"Part II, volume 8874 of LNCS","first-page":"22","volume-title":"ASIACRYPT 2014","author":"L Ducas","year":"2014","unstructured":"Ducas, L., Lyubashevsky, V., Prest, T.: Efficient identity-based encryption over NTRU lattices. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. Part II, volume 8874 of LNCS, pp. 22\u201341. Springer, Heidelberg (2014)"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Ducas, L., Postlethwaite, E.W., Pulles, L.N., van Woerden, W.P.J.: Hawk: Module LIP makes lattice signatures fast, compact and simple. IACR Cryptol. ePrint Arch., p. 1155 (2022)","DOI":"10.1007\/978-3-031-22972-5_3"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Ducas, L., Prest, T.: Fast Fourier Orthogonalization. In: ISSAC 2016, pp. 191\u2013198 (2016)","DOI":"10.1145\/2930889.2930923"},{"issue":"1","key":"3_CR13","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, W.P.J.: The closest vector problem in tensored root lattices of type a and in their duals. Des. Codes Crypt. 86(1), 137\u2013150 (2018)","journal-title":"Des. Codes Crypt."},{"key":"3_CR14","doi-asserted-by":"publisher","unstructured":"Ducas, L., Espitau, T., Postlethwaite, E.W.: Finding short integer solutions when the modulus is small. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology. CRYPTO 2023. LNCS, vol. 14083, pp. 150\u2013176. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38548-3_6","DOI":"10.1007\/978-3-031-38548-3_6"},{"key":"3_CR15","doi-asserted-by":"publisher","unstructured":"Espitau, et al.: MITAKA: a simpler, parallelizable, maskable variant of FALCON. In: Dunkelman, O., Dziembowski, S. (eds.) Advances in Cryptology. EUROCRYPT 2022. Lecture Notes in Computer Science, vol. 13277, pp. 222\u2013223. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07082-2_9","DOI":"10.1007\/978-3-031-07082-2_9"},{"key":"3_CR16","unstructured":"Espitau, T., Kirchner, P.: The nearest-colattice algorithm. ANTS 2020 (2020)"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Mitzenmacher, M., (ed.) 41st ACM STOC, pp. 169\u2013178. ACM Press, May\/June 2009","DOI":"10.1145\/1536414.1536440"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Ladner, R.E., Dwork, C., (ed.) 40th ACM STOC, pp. 197\u2013206. ACM Press, May 2008","DOI":"10.1145\/1374376.1374407"},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0024-3795(94)90481-2","volume":"198","author":"MJC Gover","year":"1994","unstructured":"Gover, M.J.C.: The eigenproblem of a tridiagonal 2-Toeplitz matrix. Linear Algebra Appl. 198, 63\u201378 (1994)","journal-title":"Linear Algebra Appl."},{"key":"3_CR20","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-38348-9_3","volume-title":"EUROCRYPT 2013","author":"V Lyubashevsky","year":"2013","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: A toolkit for ring-LWE cryptography. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 35\u201354. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_3"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V., Seiler, G.: NTTRU: truly fast NTRU using NTT. IACR TCHES. 2019(3), 180\u2013201 (2019). https:\/\/tches.iacr.org\/index.php\/TCHES\/article\/view\/8293","DOI":"10.46586\/tches.v2019.i3.180-201"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Martinet, J.: Perfection and Eutaxy, pp. 67\u2013108 (2003)","DOI":"10.1007\/978-3-662-05167-2_3"},{"key":"3_CR23","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1007\/978-3-642-29011-4_41","volume-title":"EUROCRYPT 2012","author":"D Micciancio","year":"2012","unstructured":"Micciancio, D., Peikert, C.: Trapdoors for lattices: simpler, tighter, faster, smaller. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 700\u2013718. Springer, Heidelberg (2012)"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Peikert, C.: Limits on the hardness of lattice problems in $$l_p$$ norms (2008)","DOI":"10.1007\/s00037-008-0251-3"},{"key":"3_CR25","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":"3_CR26","doi-asserted-by":"crossref","unstructured":"Peikert, C., Regev, O., Stephens-Davidowitz, N.: Pseudorandomness of ring-LWE for any ring and modulus. In: Hatami, H., McKenzie, P., King, V., (ed.) 49th ACM STOC, pp. 461\u2013473. ACM Press, June 2017","DOI":"10.1145\/3055399.3055489"},{"key":"3_CR27","series-title":"Part I, volume 11692 of LNCS","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-030-26948-7_4","volume-title":"CRYPTO 2019","author":"C Peikert","year":"2019","unstructured":"Peikert, C., Shiehian, S.: Noninteractive zero knowledge for NP from (plain) learning with errors. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. Part I, volume 11692 of LNCS, pp. 89\u2013114. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_4"},{"key":"3_CR28","unstructured":"Prest, T.: Gaussian Sampling in Lattice-Based Cryptography. Ph.D. thesis, \u00c9cole Normale Sup\u00e9rieure, Paris, France (2015)"},{"key":"3_CR29","unstructured":"Prest, T., et al.: Falcon: Submission to the NIST\u2019s post-quantum cryptography standardization process. https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/round-3-submissions"},{"key":"3_CR30","unstructured":"van Woerden, W.P.J.: The closest vector problem in cyclotomic lattices. Ph.D. thesis, Leiden University (2016)"},{"key":"3_CR31","doi-asserted-by":"publisher","unstructured":"Yu, Y., Jia, H., Wang, X.: Compact lattice gadget and its applications to hash-and-sign signatures. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology. CRYPTO 2023. LNCS, vol. 14085, pp. 390\u2013420. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_13","DOI":"10.1007\/978-3-031-38554-4_13"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-8739-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T01:02:27Z","timestamp":1765933347000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-8739-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819987382","9789819987399"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-8739-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"18 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}