{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T14:21:01Z","timestamp":1770733261529,"version":"3.49.0"},"publisher-location":"Singapore","reference-count":64,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819550982","type":"print"},{"value":"9789819550999","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-5099-9_5","type":"book-chapter","created":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T11:38:08Z","timestamp":1765107488000},"page":"133-166","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Predicting Module-Lattice Reduction"],"prefix":"10.1007","author":[{"given":"L\u00e9o","family":"Ducas","sequence":"first","affiliation":[]},{"given":"Lynn","family":"Engelberts","sequence":"additional","affiliation":[]},{"given":"Paola","family":"de Perthuis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,8]]},"reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-662-53018-4_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"M Albrecht","year":"2016","unstructured":"Albrecht, M., Bai, S., Ducas, L.: A subfield lattice attack on overstretched NTRU assumptions. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016, Part I. LNCS, vol. 9814, pp. 153\u2013178. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_6"},{"key":"5_CR2","unstructured":"Avanzi, R., et al.: CRYSTALS-Kyber algorithm specifications and supporting documentation (2021). https:\/\/pq-crystals.org\/kyber\/data\/kyber-specification-round3-20210131.pdf. Accessed 12 May 2025"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Albrecht, M., Ducas, L.: Lattice attacks on NTRU and LWE: a history of refinements. Comput. Crypt. Algorithmic Aspects Cryptology 469, 15\u201340 (2021)","DOI":"10.1017\/9781108854207.004"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/978-3-030-17656-3_25","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"MR Albrecht","year":"2019","unstructured":"Albrecht, M.R., Ducas, L., Herold, G., Kirshanova, E., Postlethwaite, E.W., Stevens, M.: The general Sieve Kernel and new records in lattice reduction. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019, Part II. LNCS, vol. 11477, pp. 717\u2013746. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_25"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1007\/978-3-662-49890-3_30","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"Y Aono","year":"2016","unstructured":"Aono, Y., Wang, Y., Hayashi, T., Takagi, T.: Improved progressive BKZ algorithms and their precise cost estimation by sharp simulator. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016, Part I. LNCS, vol. 9665, pp. 789\u2013819. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_30"},{"issue":"1","key":"5_CR6","first-page":"1","volume":"6","author":"L Babai","year":"1986","unstructured":"Babai, L.: On lov\u00e1sz\u2019 lattice reduction and the nearest lattice point problem. Comb. 6(1), 1\u201313 (1986)","journal-title":"Comb."},{"key":"5_CR7","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-319-89339-6_13","volume-title":"AFRICACRYPT 18","author":"G Bonnoron","year":"2018","unstructured":"Bonnoron, G., Ducas, L., Fillinger, M.: Large FHE gates from tensored homomorphic accumulator. In: Joux, A., Nitaj, A., Rachidi, T. (eds.) AFRICACRYPT 18. LNCS, vol. 10831, pp. 217\u2013251. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89339-6_13"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Becker, A., Ducas, L., Gama, N., Laarhoven, T.: New directions in nearest neighbor searching with applications to lattice sieving. In: Krauthgamer, R. (ed.) 27th SODA, pp. 10\u201324. ACM-SIAM (2016)","DOI":"10.1137\/1.9781611974331.ch2"},{"issue":"2","key":"5_CR9","doi-asserted-by":"publisher","first-page":"273","DOI":"10.5802\/jtnb.279","volume":"12","author":"E Bayer-Fluckiger","year":"2000","unstructured":"Bayer-Fluckiger, E.: Cyclotomic modular lattices. Journal de th\u00e9orie des nombres de Bordeaux 12(2), 273\u2013280 (2000)","journal-title":"Journal de th\u00e9orie des nombres de Bordeaux"},{"issue":"4","key":"5_CR10","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1504\/IJACT.2017.089353","volume":"3","author":"JW Bos","year":"2017","unstructured":"Bos, J.W., Naehrig, M., Van De Pol, J.: Sieving for shortest vectors in ideal lattices: a practical perspective. Int. J. Appl. Cryptogr. 3(4), 313\u2013329 (2017)","journal-title":"Int. J. Appl. Cryptogr."},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/978-3-030-03326-2_13","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"S Bai","year":"2018","unstructured":"Bai, S., Stehl\u00e9, D., Wen, W.: Measuring, simulating and exploiting the head concavity phenomenon in BKZ. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018, Part I. LNCS, vol. 11272, pp. 369\u2013404. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03326-2_13"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/978-3-662-49896-5_20","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"R Cramer","year":"2016","unstructured":"Cramer, R., Ducas, L., Peikert, C., Regev, O.: Recovering short generators of principal ideals in cyclotomic rings. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016, Part II. LNCS, vol. 9666, pp. 559\u2013585. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_20"},{"key":"5_CR13","unstructured":"Chen, Y.: R\u00e9duction de r\u00e9seau et s\u00e9curit\u00e9 concr\u00e8te du chiffrement compl\u00e8tement homomorphe. Ph.D. thesis 2013. Th\u00e8se de doctorat dirig\u00e9e par Nguyen, Phong Q. Informatique Paris 7 (2013)"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-25385-0_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"Y Chen","year":"2011","unstructured":"Chen, Y., Nguyen, P.Q.: BKZ 2.0: better lattice security estimates. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 1\u201320. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_1"},{"key":"5_CR15","unstructured":"de\u00a0Boer, K., van Woerden, W.: Lattice-based cryptography: a survey on the security of the lattice-based NIST finalists. Cryptology ePrint Archive, Paper 2025\/304 (2025)"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-642-30057-8_3","volume-title":"Public Key Cryptography \u2013 PKC 2012","author":"L Ducas","year":"2012","unstructured":"Ducas, L., Durmus, A.: Ring-LWE in polynomial rings. In: Fischlin, M., Buchmann, J., Manulis, M. (eds.) PKC 2012. LNCS, vol. 7293, pp. 34\u201351. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-30057-8_3"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-030-56880-1_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"D Dachman-Soled","year":"2020","unstructured":"Dachman-Soled, D., Ducas, L., Gong, H., Rossi, M.: LWE with side information: attacks and concrete security estimation. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020, Part II. LNCS, vol. 12171, pp. 329\u2013358. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_12"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Ducas, L., Prest, T.: Fast Fourier orthogonalization. In: Proceedings of the 2016 ACM International Symposium on Symbolic and Algebraic Computation, pp. 191\u2013198 (2016)","DOI":"10.1145\/2930889.2930923"},{"key":"5_CR19","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-031-22972-5_3","volume-title":"ASIACRYPT 2022, Part IV","author":"L Ducas","year":"2022","unstructured":"Ducas, L., Postlethwaite, E.W., Pulles, L.N., van Woerden, P.J.: HAWK: module LIP makes lattice signatures fast, compact and simple. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022, Part IV. LNCS, vol. 13794, pp. 65\u201394. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22972-5_3"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-030-77886-6_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"L Ducas","year":"2021","unstructured":"Ducas, L., Stevens, M., van Woerden, W.: Advanced lattice sieving on GPUs, with tensor cores. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021, Part II. LNCS, vol. 12697, pp. 249\u2013279. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_9"},{"key":"5_CR21","unstructured":"The\u00a0FPLLL Development Team: FPLLL, a lattice reduction library, Version: 5.4.5 (2023). https:\/\/github.com\/fplll\/fplll"},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-319-78381-9_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"L Ducas","year":"2018","unstructured":"Ducas, L.: Shortest vector from lattice sieving: a few dimensions for Free. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018, Part I. LNCS, vol. 10820, pp. 125\u2013145. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_5"},{"issue":"1","key":"5_CR23","first-page":"137","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. DCC 86(1), 137\u2013150 (2018)","journal-title":"DCC"},{"key":"5_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-92068-5_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"L Ducas","year":"2021","unstructured":"Ducas, L., van Woerden, W.: NTRU fatigue: how stretched is overstretched? In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021, Part IV. LNCS, vol. 13093, pp. 3\u201332. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92068-5_1"},{"key":"5_CR25","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/978-3-031-07082-2_23","volume-title":"EUROCRYPT 2022, Part III","author":"L Ducas","year":"2022","unstructured":"Ducas, L., van Woerden, W.P.J.: On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022, Part III. LNCS, vol. 13277, pp. 643\u2013673. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07082-2_23"},{"key":"5_CR26","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-031-07082-2_9","volume-title":"EUROCRYPT 2022, Part III","author":"T Espitau","year":"2022","unstructured":"Espitau, T., et al.: MITAKA: a simpler, parallelizable, maskable variant of falcon. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022, Part III. LNCS, vol. 13277, pp. 222\u2013253. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07082-2_9"},{"key":"5_CR27","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-981-99-8739-9_3","volume-title":"ASIACRYPT 2023, Part VII","author":"T Espitau","year":"2023","unstructured":"Espitau, T., Wallet, A., Yang, Yu.: On gaussian sampling, smoothing parameter and application to signatures. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT 2023, Part VII. LNCS, vol. 14444, pp. 65\u201397. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8739-9_3"},{"key":"5_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-642-14518-6_15","volume-title":"Algorithmic Number Theory","author":"C Fieker","year":"2010","unstructured":"Fieker, C., Stehl\u00e9, D.: Short bases of lattices over number fields. In: Hanrot, G., Morain, F., Thom\u00e9, E. (eds.) ANTS 2010. LNCS, vol. 6197, pp. 157\u2013173. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14518-6_15"},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"Gama, N., Nguyen, P.Q.: Finding short lattice vectors within Mordell\u2019s inequality. In: Ladner, R.E., Dwork, C. (eds.) 40th ACM STOC, pp. 207\u2013216. ACM Press (2008)","DOI":"10.1145\/1374376.1374408"},{"key":"5_CR30","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-78967-3_3","volume-title":"EUROCRYPT 2008","author":"N Gama","year":"2008","unstructured":"Gama, N., Nguyen, P.Q.: Predicting lattice reduction. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 31\u201351. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_3"},{"key":"5_CR31","unstructured":"Gargava, N., Serban, V., Viazovska, M., Viglino, I.: Effective module lattices and their shortest vectors (2024)"},{"key":"5_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BFb0054868","volume-title":"Algorithmic Number Theory","author":"J Hoffstein","year":"1998","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: a ring-based public key cryptosystem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 267\u2013288. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054868"},{"key":"5_CR33","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/978-3-642-22792-9_25","volume-title":"CRYPTO 2011","author":"G Hanrot","year":"2011","unstructured":"Hanrot, G., Pujol, X., Stehl\u00e9, D.: Analyzing blockwise lattice algorithms using dynamical systems. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 447\u2013464. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_25"},{"key":"5_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/978-3-662-44371-2_31","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"S Halevi","year":"2014","unstructured":"Halevi, S., Shoup, V.: Algorithms in HElib. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014, Part I. LNCS, vol. 8616, pp. 554\u2013571. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_31"},{"key":"5_CR35","unstructured":"Hong, G.H., Woo, J., Kim, J., Kim, M., Lee, H., Park, J.H.: More NTRU+sign signatures from cyclotomic trinomials. Cryptology ePrint Archive, Paper 2025\/612 (2025)"},{"key":"5_CR36","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-031-64381-1_18","volume-title":"AFRICACRYPT 2024","author":"A Karenin","year":"2024","unstructured":"Karenin, A., Kirshanova, E.: Finding dense submodules with algebraic lattice reduction. In: Vaudenay, S., Petit, C. (eds.) AFRICACRYPT 2024. LNCS, vol. 14861, pp. 403\u2013427. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-64381-1_18"},{"key":"5_CR37","unstructured":"KpqC. Selected Algorithms from the KpqC Competition Round 2 (2025). https:\/\/kpqc.or.kr\/competition_02.html. Accessed 14 May 2025"},{"key":"5_CR38","unstructured":"Laarhoven, T.: Search problems in cryptography: from fingerprinting to lattice sieving (2016)"},{"key":"5_CR39","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, H.W., Lov\u00e1sz, L.M.: Factoring polynomials with rational coefficients. Mathematische Annalen 261, 515\u2013534 (1982)","journal-title":"Mathematische Annalen"},{"key":"5_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-319-79063-3_14","volume-title":"Post-Quantum Cryptography","author":"T Laarhoven","year":"2018","unstructured":"Laarhoven, T., Mariano, A.: Progressive lattice sieving. In: Lange, T., Steinwandt, R. (eds.) PQCrypto 2018. LNCS, vol. 10786, pp. 292\u2013311. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-79063-3_14"},{"key":"5_CR41","unstructured":"Li, J., Nguyen, P.Q.: A complete analysis of the BKZ lattice reduction algorithm. Cryptology ePrint Archive, Report 2020\/1237 (2020)"},{"key":"5_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-13190-5_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"V Lyubashevsky","year":"2010","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. In: Gilbert, H. (ed.) On ideal lattices and learning with errors over rings. LNCS, vol. 6110, pp. 1\u201323. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_1"},{"key":"5_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-030-34621-8_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"C Lee","year":"2019","unstructured":"Lee, C., Pellet-Mary, A., Stehl\u00e9, D., Wallet, A.: An LLL algorithm for module lattices. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019, Part II. LNCS, vol. 11922, pp. 59\u201390. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34621-8_3"},{"issue":"3","key":"5_CR44","first-page":"565","volume":"75","author":"A Langlois","year":"2015","unstructured":"Langlois, A., Stehl\u00e9, D.: Worst-case to average-case reductions for module lattices. DCC 75(3), 565\u2013599 (2015)","journal-title":"DCC"},{"issue":"3","key":"5_CR45","doi-asserted-by":"publisher","first-page":"180","DOI":"10.46586\/tches.v2019.i3.180-201","volume":"2019","author":"V Lyubashevsky","year":"2019","unstructured":"Lyubashevsky, V., Seiler, G.: NTTRU: truly fast NTRU using NTT. IACR TCHES 2019(3), 180\u2013201 (2019)","journal-title":"IACR TCHES"},{"key":"5_CR46","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, 65\u201373 (1978)","journal-title":"Invent. Math."},{"key":"5_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-030-56880-1_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"T Mukherjee","year":"2020","unstructured":"Mukherjee, T., Stephens-Davidowitz, N.: Lattice reduction for modules, or\u00a0how\u00a0to\u00a0reduce\u00a0ModuleSVP\u00a0to\u00a0ModuleSVP. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020, Part II. LNCS, vol. 12171, pp. 213\u2013242. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_8"},{"key":"5_CR48","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Voulgaris, P.: Faster exponential time algorithms for the shortest vector problem. In: Charika, M. (ed.) 21st SODA, pp. 1468\u20131480. ACM-SIAM (2010)","DOI":"10.1137\/1.9781611973075.119"},{"key":"5_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1007\/978-3-662-49890-3_31","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"D Micciancio","year":"2016","unstructured":"Micciancio, D., Walter, M.: Practical, predictable lattice basis reduction. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016, Part I. LNCS, vol. 9665, pp. 820\u2013849. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_31"},{"key":"5_CR50","unstructured":"National Institute of Standards and Technology (NIST): Post-Quantum Cryptography: Selected Algorithms (2022). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/selected-algorithms. Accessed 29 Apr 2025"},{"key":"5_CR51","unstructured":"Prest, T., et al.: Falcon. Technical report, National Institute of Standards and Technology (2017). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/round-1-submissions. Accessed 28 Apr 2025"},{"key":"5_CR52","volume-title":"On ideal lattices and the GGH13 multilinear map","author":"A Pellet-Mary","year":"2019","unstructured":"Pellet-Mary, A.: On ideal lattices and the GGH13 multilinear map. Universit\u00e9 de Lyon, Theses (2019)"},{"key":"5_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-030-75245-3_4","volume-title":"Public-Key Cryptography \u2013 PKC 2021","author":"EW Postlethwaite","year":"2021","unstructured":"Postlethwaite, E.W., Virdia, F.: On the success probability of solving unique SVP via BKZ. In: Garay, J.A. (ed.) PKC 2021. LNCS, vol. 12710, pp. 68\u201398. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75245-3_4"},{"issue":"2","key":"5_CR54","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1112\/plms\/s3-6.2.305","volume":"s3\u20136","author":"CA Rogers","year":"1956","unstructured":"Rogers, C.A.: The number of lattice points in a set. Proc. Lond. Math. Soc. s3\u20136(2), 305\u2013320 (1956)","journal-title":"Proc. Lond. Math. Soc."},{"key":"5_CR55","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-3975(87)90064-8","volume":"53","author":"C-P Schnorr","year":"1987","unstructured":"Schnorr, C.-P.: A hierarchy of polynomial time lattice basis reduction algorithms. Theoret. Comput. Sci. 53, 201\u2013224 (1987)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/3-540-36494-3_14","volume-title":"STACS 2003","author":"CP Schnorr","year":"2003","unstructured":"Schnorr, C.P.: Lattice reduction by random sampling and birthday methods. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 145\u2013156. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36494-3_14"},{"key":"5_CR57","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01581144","volume":"66","author":"C-P Schnorr","year":"1994","unstructured":"Schnorr, C.-P., Euchner, M.: Lattice basis reduction: improved practical algorithms and solving subset sum problems. Math. Program. 66, 181\u2013199 (1994)","journal-title":"Math. Program."},{"issue":"2","key":"5_CR58","doi-asserted-by":"publisher","first-page":"340","DOI":"10.2307\/1969027","volume":"46","author":"CL Siegel","year":"1945","unstructured":"Siegel, C.L.: A mean value theorem in geometry of numbers. Ann. Math. 46(2), 340\u2013347 (1945)","journal-title":"Ann. Math."},{"issue":"3","key":"5_CR59","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1007\/s00209-010-0772-8","volume":"269","author":"A S\u00f6dergren","year":"2011","unstructured":"S\u00f6dergren, A.: On the poisson distribution of lengths of lattice vectors in a random lattice. Math. Z. 269(3), 945\u2013954 (2011)","journal-title":"Math. Z."},{"key":"5_CR60","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-642-20465-4_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"D Stehl\u00e9","year":"2011","unstructured":"Stehl\u00e9, D., Steinfeld, R.: Making NTRU as secure as worst-case problems over ideal lattices. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 27\u201347. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_4"},{"key":"5_CR61","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/978-3-642-10366-7_36","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"D Stehl\u00e9","year":"2009","unstructured":"Stehl\u00e9, D., Steinfeld, R., Tanaka, K., Xagawa, K.: Efficient public key encryption based on ideal lattices. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 617\u2013635. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_36"},{"key":"5_CR62","doi-asserted-by":"crossref","unstructured":"Washington, L.C.: Introduction to cyclotomic fields (1982)","DOI":"10.1007\/978-1-4684-0133-2"},{"key":"5_CR63","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-031-57725-3_1","volume-title":"PKC 2024, Part II","author":"W Xia","year":"2024","unstructured":"Xia, W., Wang, L., Wang, G., Dawu, G., Wang, B.: A refined hardness estimation of LWE in two-step mode. In: Tang, Q., Teague, V. (eds.) PKC 2024, Part II. LNCS, vol. 14603, pp. 3\u201335. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-57725-3_1"},{"key":"5_CR64","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-72565-9_1","volume-title":"Selected Areas in Cryptography \u2013 SAC 2017","author":"Y Yu","year":"2018","unstructured":"Yu, Y., Ducas, L.: Second order statistical behavior of\u00a0LLL\u00a0and\u00a0BKZ. In: Adams, C., Camenisch, J. (eds.) SAC 2017. LNCS, vol. 10719, pp. 3\u201322. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-72565-9_1"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-5099-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T17:49:17Z","timestamp":1770659357000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-5099-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,8]]},"ISBN":["9789819550982","9789819550999"],"references-count":64,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-5099-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,8]]},"assertion":[{"value":"8 December 2025","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":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","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":"8 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}