{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T19:44:54Z","timestamp":1778528694634,"version":"3.51.4"},"publisher-location":"Singapore","reference-count":69,"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_3","type":"book-chapter","created":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T11:38:10Z","timestamp":1765107490000},"page":"65-99","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Towards a\u00a0Modern LLL Implementation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2510-4829","authenticated-orcid":false,"given":"L\u00e9o","family":"Ducas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8014-9221","authenticated-orcid":false,"given":"Ludo N.","family":"Pulles","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7091-2924","authenticated-orcid":false,"given":"Marc","family":"Stevens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,12,8]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","unstructured":"Albrecht, M.R., Ducas, L.: Lattice attacks on NTRU and LWE: a history of refinements, pp. 15\u201340. London Mathematical Society Lecture Note Series, Cambridge University Press, Cambridge, United Kingdom (2021). https:\/\/doi.org\/10.1017\/9781108854207","DOI":"10.1017\/9781108854207"},{"key":"3_CR2","doi-asserted-by":"publisher","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\u00a02019, Part\u00a0II. LNCS, vol. 11477, pp. 717\u2013746. Springer, Cham, May 2019. https:\/\/doi.org\/10.1007\/978-3-030-17656-3_25","DOI":"10.1007\/978-3-030-17656-3_25"},{"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 Lov\u00e1sz\u2019 lattice reduction and the nearest lattice point problem. Combinatorica 6(1), 1\u201313 (1986). https:\/\/doi.org\/10.1007\/BF02579403","journal-title":"Combinatorica"},{"key":"3_CR4","doi-asserted-by":"publisher","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, January 2016. https:\/\/doi.org\/10.1137\/1.9781611974331.ch2","DOI":"10.1137\/1.9781611974331.ch2"},{"key":"3_CR5","unstructured":"Behnel, S., Bradshaw, R., Woods, D., Valo, M., Dalc\u00edn, L., et\u00a0al.: Cython: C-Extensions for Python. https:\/\/cython.org (2024)"},{"key":"3_CR6","doi-asserted-by":"publisher","unstructured":"Benson, A.R., Ballard, G.: A framework for practical parallel fast matrix multiplication. In: Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2015, pp. 42\u201353. ACM, New York, United States (2015). https:\/\/doi.org\/10.1145\/2688500.2688513","DOI":"10.1145\/2688500.2688513"},{"key":"3_CR7","doi-asserted-by":"publisher","unstructured":"Bodrato, M., Zanoni, A.: Integer and polynomial multiplication: towards optimal Toom-Cook matrices. In: Proceedings of the 2007 International Symposium on Symbolic and Algebraic Computation, ISSAC 2007, pp. 17\u201324. ACM, New York, United States (2007). https:\/\/doi.org\/10.1145\/1277548.1277552","DOI":"10.1145\/1277548.1277552"},{"key":"3_CR8","unstructured":"Bos, J.W., et al.: HAWK. Technical Report, National Institute of Standards and Technology (2023). https:\/\/csrc.nist.gov\/Projects\/pqc-dig-sig\/round-1-additional-signatures"},{"key":"3_CR9","doi-asserted-by":"publisher","unstructured":"Brickell, E.F.: Solving low density knapsacks. In: Chaum, D. (ed.) CRYPTO\u201983. pp. 25\u201337. Plenum Press, New York, USA (1983). https:\/\/doi.org\/10.1007\/978-1-4684-4730-9_2","DOI":"10.1007\/978-1-4684-4730-9_2"},{"key":"3_CR10","doi-asserted-by":"publisher","unstructured":"Brickell, E.F.: Breaking iterated knapsacks. In: Blakley, G.R., Chaum, D. (eds.) CRYPTO\u201984. LNCS, vol.\u00a0196, pp. 342\u2013358. Springer, Berlin, Heidelberg, August 1984. https:\/\/doi.org\/10.1007\/3-540-39568-7_27","DOI":"10.1007\/3-540-39568-7_27"},{"issue":"279","key":"3_CR11","doi-asserted-by":"publisher","first-page":"1487","DOI":"10.1090\/S0025-5718-2012-02545-2","volume":"81","author":"XW Chang","year":"2012","unstructured":"Chang, X.W., Stehl\u00e9, D., Villard, G.: Perturbation analysis of the QR factor R in the context of LLL lattice basis reduction. Math. Comput. 81(279), 1487\u20131511 (2012). https:\/\/doi.org\/10.1090\/S0025-5718-2012-02545-2","journal-title":"Math. Comput."},{"key":"3_CR12","unstructured":"Chang, X.W., Stehl\u00e9, D., Villard, G., Wen, J.: Floating-point LLL reduction with a smaller precision. Draft (2021)"},{"key":"3_CR13","unstructured":"Chen, Y.: R\u00e9duction de r\u00e9seau et s\u00e9curit\u00e9 concrete du chiffrement completement homomorphe. Phd thesis, Universit\u00e9 Paris Diderot, 13 November\u00a02013, https:\/\/archive.org\/details\/PhDChen13"},{"key":"3_CR14","doi-asserted-by":"publisher","unstructured":"Chen, Y., Nguyen, P.Q.: BKZ 2.0: better lattice security estimates. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT\u00a02011. LNCS, vol.\u00a07073, pp. 1\u201320. Springer, Berlin, Heidelberg, December 2011. https:\/\/doi.org\/10.1007\/978-3-642-25385-0_1","DOI":"10.1007\/978-3-642-25385-0_1"},{"issue":"4","key":"3_CR15","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s001459900030","volume":"10","author":"D Coppersmith","year":"1997","unstructured":"Coppersmith, D.: Small solutions to polynomial equations, and low exponent RSA vulnerabilities. J. Cryptol. 10(4), 233\u2013260 (1997). https:\/\/doi.org\/10.1007\/s001459900030","journal-title":"J. Cryptol."},{"key":"3_CR16","doi-asserted-by":"publisher","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. In: Aho, A. (ed.) 19th ACM STOC, pp.\u00a01\u20136. ACM Press, May 1987. https:\/\/doi.org\/10.1145\/28395.28396","DOI":"10.1145\/28395.28396"},{"key":"3_CR17","doi-asserted-by":"publisher","unstructured":"Ducas, L.: Shortest vector from lattice sieving: a few dimensions for free. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT\u00a02018, Part\u00a0I. LNCS, vol. 10820, pp. 125\u2013145. Springer, Cham, April\/May 2018. https:\/\/doi.org\/10.1007\/978-3-319-78381-9_5","DOI":"10.1007\/978-3-319-78381-9_5"},{"key":"3_CR18","doi-asserted-by":"publisher","unstructured":"Ducas, L., Stevens, M., van Woerden, W.P.J.: Advanced lattice sieving on GPUs, with tensor cores. In: Canteaut, A., Standaert, F.X. (eds.) EUROCRYPT\u00a02021, Part\u00a0II. LNCS, vol. 12697, pp. 249\u2013279. Springer, Cham, October 2021. https:\/\/doi.org\/10.1007\/978-3-030-77886-6_9","DOI":"10.1007\/978-3-030-77886-6_9"},{"issue":"2","key":"3_CR19","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s10623-014-9918-8","volume":"73","author":"F Fontein","year":"2014","unstructured":"Fontein, F., Schneider, M., Wagner, U.: PotLLL: a polynomial time version of LLL with deep insertions. Des. Codes Crypt. 73(2), 355\u2013368 (2014). https:\/\/doi.org\/10.1007\/s10623-014-9918-8","journal-title":"Des. Codes Crypt."},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Fousse, L., Hanrot, G., Lef\u00e8vre, V., P\u00e9lissier, P., Zimmermann, P.: MPFR: a multiple-precision binary floating-point library with correct rounding. ACM Trans. Math. Softw. (TOMS) 33(2), 13\u2013es (2007)","DOI":"10.1145\/1236463.1236468"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Frigo, M., Johnson, S.G.: FFTW: an adaptive software architecture for the FFT. In: Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP\u201998 (Cat. No. 98CH36181), vol.\u00a03, pp. 1381\u20131384. IEEE (1998)","DOI":"10.1109\/ICASSP.1998.681704"},{"key":"3_CR22","doi-asserted-by":"publisher","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, May 2008. https:\/\/doi.org\/10.1145\/1374376.1374408","DOI":"10.1145\/1374376.1374408"},{"key":"3_CR23","doi-asserted-by":"publisher","unstructured":"Gama, N., Nguyen, P.Q.: Predicting lattice reduction. In: Smart, N.P. (ed.) EUROCRYPT\u00a02008. LNCS, vol.\u00a04965, pp. 31\u201351. Springer, Berlin, Heidelberg, April 2008. https:\/\/doi.org\/10.1007\/978-3-540-78967-3_3","DOI":"10.1007\/978-3-540-78967-3_3"},{"key":"3_CR24","doi-asserted-by":"publisher","unstructured":"Gama, N., Nguyen, P.Q., Regev, O.: Lattice enumeration using extreme pruning. In: Gilbert, H. (ed.) EUROCRYPT\u00a02010. LNCS, vol.\u00a06110, pp. 257\u2013278. Springer, Berlin, Heidelberg, May\/June 2010. https:\/\/doi.org\/10.1007\/978-3-642-13190-5_13","DOI":"10.1007\/978-3-642-13190-5_13"},{"key":"3_CR25","unstructured":"Granlund, T.: The GMP development team: GNU MP: the GNU multiple precision arithmetic library, 5.0.5 edn. (2012). http:\/\/gmplib.org\/"},{"key":"3_CR26","unstructured":"Guennebaud, G., Jacob, B., et\u00a0al.: Eigen v3 library. http:\/\/eigen.tuxfamily.org\/ and https:\/\/libeigen.gitlab.io\/docs\/index.html (2010\u20132023)"},{"key":"3_CR27","doi-asserted-by":"publisher","unstructured":"Hanrot, G., Pujol, X., Stehl\u00e9, D.: Analyzing blockwise lattice algorithms using dynamical systems. In: Rogaway, P. (ed.) CRYPTO\u00a02011. LNCS, vol.\u00a06841, pp. 447\u2013464. Springer, Berlin, Heidelberg, August 2011. https:\/\/doi.org\/10.1007\/978-3-642-22792-9_25","DOI":"10.1007\/978-3-642-22792-9_25"},{"key":"3_CR28","doi-asserted-by":"publisher","unstructured":"Heckler, C., Thiele, L.: Parallel complexity of lattice basis reduction and a floating-point parallel algorithm. In: Bode, A., Reeve, M., Wolf, G. (eds.) PARLE \u201993 Parallel Architectures and Languages Europe. vol.\u00a0694, pp. 744\u2013747. Springer, Berlin, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-56891-3_74","DOI":"10.1007\/3-540-56891-3_74"},{"issue":"4","key":"3_CR29","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1145\/98267.98290","volume":"16","author":"NJ Higham","year":"1990","unstructured":"Higham, N.J.: Exploiting fast matrix multiplication within the level 3 BLAS. ACM Trans. Math. Softw. (TOMS) 16(4), 352\u2013368 (1990). https:\/\/doi.org\/10.1145\/98267.98290","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"key":"3_CR30","doi-asserted-by":"publisher","unstructured":"Higham, N.J.: Accuracy and stability of numerical algorithms. Society for Industrial and Applied Mathematics, United States, second edn. 1 August\u00a02002. https:\/\/doi.org\/10.1137\/1.9780898718027","DOI":"10.1137\/1.9780898718027"},{"issue":"2","key":"3_CR31","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1006\/jnth.2001.2763","volume":"95","author":"M van Hoeij","year":"2002","unstructured":"van Hoeij, M.: Factoring polynomials and the knapsack problem. J. Number Theor. 95(2), 167\u2013189 (2002). https:\/\/doi.org\/10.1006\/jnth.2001.2763","journal-title":"J. Number Theor."},{"key":"3_CR32","doi-asserted-by":"crossref","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: a ring-based public key cryptosystem. In: Third Algorithmic Number Theory Symposium (ANTS). LNCS, vol.\u00a01423, pp. 267\u2013288. Springer, June 1998","DOI":"10.1007\/BFb0054868"},{"key":"3_CR33","unstructured":"Huang, J.: Practical fast matrix multiplication algorithms. Phd thesis, The University of Texas at Austin, August 2018, http:\/\/hdl.handle.net\/2152\/69013"},{"key":"3_CR34","doi-asserted-by":"publisher","unstructured":"Kaltofen, E.: On the complexity of finding short vectors in integer lattices. In: van Hulzen, J.A. (ed.) European Conference on Computer Algebra, pp. 236\u2013244. EUROCAL \u201983, Springer, Berlin, Heidelberg, Germany, 28\u201330 March 1983). https:\/\/doi.org\/10.1007\/3-540-12868-9_107","DOI":"10.1007\/3-540-12868-9_107"},{"key":"3_CR35","doi-asserted-by":"publisher","unstructured":"Kirchner, P., Espitau, T., Fouque, P.A.: Towards faster polynomial-time lattice reduction. In: Malkin, T., Peikert, C. (eds.) CRYPTO\u00a02021, Part\u00a0II. LNCS, vol. 12826, pp. 760\u2013790. Springer, Cham, Virtual Event, August 2021. https:\/\/doi.org\/10.1007\/978-3-030-84245-1_26","DOI":"10.1007\/978-3-030-84245-1_26"},{"key":"3_CR36","doi-asserted-by":"publisher","unstructured":"Koy, H., Schnorr, C.P.: Segment LLL-reduction of lattice bases. In: Silverman, J.H. (ed.) Cryptography and Lattices, pp. 67\u201380. Springer, Berlin, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44670-2_7","DOI":"10.1007\/3-540-44670-2_7"},{"key":"3_CR37","doi-asserted-by":"publisher","unstructured":"Koy, H., Schnorr, C.P.: Segment LLL-reduction with floating point orthogonalization. In: Silverman, J.H. (ed.) Cryptography and Lattices, pp. 81\u201396. Springer, Berlin, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44670-2_8","DOI":"10.1007\/3-540-44670-2_8"},{"key":"3_CR38","doi-asserted-by":"publisher","unstructured":"Lagarias, J.C., Odlyzko, A.M.: Solving low-density subset sum problems. In: 24th FOCS, pp. 1\u201310. IEEE Computer Society Press, November 1983. https:\/\/doi.org\/10.1109\/SFCS.1983.70","DOI":"10.1109\/SFCS.1983.70"},{"key":"3_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., Jr., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Math. Ann. 261, 515\u2013534 (1982). https:\/\/doi.org\/10.1007\/BF01457454","journal-title":"Math. Ann."},{"key":"3_CR40","unstructured":"Lyubashevsky, V., Ducas, L., Kiltz, E., Lepoint, T., Schwabe, P., Seiler, G., Stehl\u00e9, D., Bai, S.: CRYSTALS-DILITHIUM. Technical Report, National Institute of Standards and Technology (2022). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/selected-algorithms-2022"},{"key":"3_CR41","unstructured":"Micciancio, D.: CSE206A: Lattices algorithms and applications (2021). https:\/\/cseweb.ucsd.edu\/classes\/fa21\/cse206A-a\/"},{"key":"3_CR42","unstructured":"Minkowski, H.: Geometrie der zahlen. B.G. Teubner, Leipzig, Germany (1896)"},{"key":"3_CR43","doi-asserted-by":"publisher","unstructured":"Morel, I., Stehl\u00e9, D., Villard, G.: H-LLL: using householder inside LLL. In: Proceedings of the 2009 International Symposium on Symbolic and Algebraic Computation, ISSAC 2009, pp. 271\u2013278. ACM, New York, United States, 28\u201331 July\u00a02009. https:\/\/doi.org\/10.1145\/1576702.1576740","DOI":"10.1145\/1576702.1576740"},{"key":"3_CR44","doi-asserted-by":"publisher","unstructured":"Neumaier, A.: Bounding basis reduction properties. DCC 84(1-2), 237\u2013259 (2017). https:\/\/doi.org\/10.1007\/s10623-016-0273-9","DOI":"10.1007\/s10623-016-0273-9"},{"key":"3_CR45","doi-asserted-by":"publisher","unstructured":"Neumaier, A., Stehl\u00e9, D.: Faster LLL-type reduction of lattice bases. In: Proceedings of the 2016 ACM International Symposium on Symbolic and Algebraic Computation, ISSAC 2016, pp. 373\u2013380. ACM, New York, United States, 20\u201322 July\u00a02016. https:\/\/doi.org\/10.1145\/2930889.2930917","DOI":"10.1145\/2930889.2930917"},{"key":"3_CR46","doi-asserted-by":"publisher","unstructured":"Nguyen, P.Q., Stehl\u00e9, D.: LLL on the average. In: Hess, F., Pauli, S., Pohst, M. (eds.) Algorithmic Number Theory, ANTS 2006, pp. 238\u2013256. Springer, Berlin, Heidelberg, 23\u201328 July\u00a02006. https:\/\/doi.org\/10.1007\/11792086_18","DOI":"10.1007\/11792086_18"},{"key":"3_CR47","doi-asserted-by":"publisher","unstructured":"Nguyen, P.Q., Stehl\u00e9, D.: An LLL algorithm with quadratic complexity. SIAM J. Comput. 39(3), 874\u2013903 (2009). https:\/\/doi.org\/10.1137\/070705702, preliminary version in EuroCrypt 2005","DOI":"10.1137\/070705702"},{"key":"3_CR48","doi-asserted-by":"publisher","unstructured":"Nguyen, P.Q., Vall\u00e9e, B. (eds.): The LLL algorithm - survey and applications. ISC, Springer (2010). https:\/\/doi.org\/10.1007\/978-3-642-02295-1","DOI":"10.1007\/978-3-642-02295-1"},{"issue":"2","key":"3_CR49","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1515\/JMC.2008.009","volume":"2","author":"PQ Nguyen","year":"2008","unstructured":"Nguyen, P.Q., Vidick, T.: Sieve algorithms for the shortest vector problem are practical. J. Math. Cryptol. 2(2), 181\u2013207 (2008). https:\/\/doi.org\/10.1515\/JMC.2008.009","journal-title":"J. Math. Cryptol."},{"key":"3_CR50","doi-asserted-by":"publisher","unstructured":"Novocin, A., Stehl\u00e9, D., Villard, G.: An LLL-reduction algorithm with quasi-linear time complexity: extended abstract. In: Fortnow, L., Vadhan, S.P. (eds.) 43rd ACM STOC, pp. 403\u2013412. ACM Press, June 2011. https:\/\/doi.org\/10.1145\/1993636.1993691","DOI":"10.1145\/1993636.1993691"},{"key":"3_CR51","unstructured":"Prest, T., et al.: FALCON. Technical Report, National Institute of Standards and Technology (2022). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/selected-algorithms-2022"},{"key":"3_CR52","doi-asserted-by":"publisher","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56(6), 1\u201340 (2009). https:\/\/doi.org\/10.1145\/1568318.1568324, preliminary version in STOC 2005","DOI":"10.1145\/1568318.1568324"},{"key":"3_CR53","doi-asserted-by":"publisher","unstructured":"Ryan, K., Heninger, N.: Fast practical lattice reduction through iterated compression. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO\u00a02023, Part\u00a0III. LNCS, vol. 14083, pp. 3\u201336. Springer, Cham, August 2023. https:\/\/doi.org\/10.1007\/978-3-031-38548-3_1","DOI":"10.1007\/978-3-031-38548-3_1"},{"key":"3_CR54","doi-asserted-by":"publisher","unstructured":"Saruchi, Morel, I., Stehl\u00e9, D., Villard, G.: LLL reducing with the most significant bits. In: Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, ISSAC 2014, pp. 367\u2013374. ACM, New York, United States, 23\u201325 July\u00a02014. https:\/\/doi.org\/10.1145\/2608628.2608645","DOI":"10.1145\/2608628.2608645"},{"key":"3_CR55","doi-asserted-by":"publisher","unstructured":"Schnorr, C.P.: A more efficient algorithm for lattice basis reduction. J. Algorithms 9(1), 47\u201362 (1988). https:\/\/doi.org\/10.1016\/0196-6774(88)90004-1, preliminary version in ICALP 1986","DOI":"10.1016\/0196-6774(88)90004-1"},{"key":"3_CR56","doi-asserted-by":"publisher","unstructured":"Schnorr, C.P.: Lattice reduction by random sampling and birthday methods. In: Alt, H., Habib, M. (eds.) 20th Annual Symposium on Theoretical Aspects of Computer Science. STACS 2003, vol.\u00a02607, pp. 145\u2013156. Springer February\u00a027\u2013March\u00a01, 2003. https:\/\/doi.org\/10.1007\/3-540-36494-3_14","DOI":"10.1007\/3-540-36494-3_14"},{"issue":"1","key":"3_CR57","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2005.04.004","volume":"204","author":"CP Schnorr","year":"2006","unstructured":"Schnorr, C.P.: Fast LLL-type lattice reduction. Inf. Comput. 204(1), 1\u201325 (2006). https:\/\/doi.org\/10.1016\/j.ic.2005.04.004","journal-title":"Inf. Comput."},{"key":"3_CR58","doi-asserted-by":"publisher","unstructured":"Schnorr, C.P.: Progress on LLL and lattice reduction. In: Nguyen and Vall\u00e9e [48], pp. 145\u2013178. https:\/\/doi.org\/10.1007\/978-3-642-02295-1","DOI":"10.1007\/978-3-642-02295-1"},{"key":"3_CR59","doi-asserted-by":"publisher","unstructured":"Schnorr, C.P., Euchner, M.: Lattice basis reduction: improved practical algorithms and solving subset sum problems. Math. Program. 66, 181\u2013199 (1994). https:\/\/doi.org\/10.1007\/BF01581144, preliminary version in FCT 1991","DOI":"10.1007\/BF01581144"},{"key":"3_CR60","doi-asserted-by":"publisher","unstructured":"Sch\u00f6nhage, A.: Factorization of univariate integer polynomials by diophantine approximation and an improved basis reduction algorithm. In: Paredaens, J. (ed.) Automata, Languages and Programming, ICALP 1984, pp. 436\u2013447. Springer, Berlin, Heidelberg, Germany, July 1984. https:\/\/doi.org\/10.1007\/3-540-13345-3_40","DOI":"10.1007\/3-540-13345-3_40"},{"key":"3_CR61","doi-asserted-by":"publisher","unstructured":"Sch\u00f6nhage, A.: Fast reduction and composition of binary quadratic forms. In: Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation, ISSAC 1991, pp. 128\u2013133. ACM, New York, United States (1991). https:\/\/doi.org\/10.1145\/120694.120711","DOI":"10.1145\/120694.120711"},{"key":"3_CR62","unstructured":"Schwabe, P., et al.: CRYSTALS-KYBER. Technical Report, National Institute of Standards and Technology (2022), https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/selected-algorithms-2022"},{"issue":"3","key":"3_CR63","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/BF01202355","volume":"13","author":"M Seysen","year":"1993","unstructured":"Seysen, M.: Simultaneous reduction of a lattice basis and its reciprocal basis. Combinatorica 13(3), 363\u2013376 (1993). https:\/\/doi.org\/10.1007\/BF01202355","journal-title":"Combinatorica"},{"key":"3_CR64","unstructured":"Shoup, V.: NTL: A library for doing number theory. http:\/\/www.shoup.net\/ntl\/index.html (1996\u20132021)"},{"key":"3_CR65","doi-asserted-by":"publisher","unstructured":"Stehl\u00e9, D.: Floating-point LLL: theoretical and practical aspects. In: Nguyen and Vall\u00e9e [48], pp. 179\u2013213. https:\/\/doi.org\/10.1007\/978-3-642-02295-1","DOI":"10.1007\/978-3-642-02295-1"},{"key":"3_CR66","unstructured":"Storjohann, A.: Faster algorithms for integer lattice basis reduction. Tech. Rep.\/ETH Zurich, Dep. Comput. Sci. 249 (1996)"},{"key":"3_CR67","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/BF02165411","volume":"13","author":"V Strassen","year":"1969","unstructured":"Strassen, V.: Gaussian elimination is not optimal. Numer. Math. 13, 354\u2013356 (1969). https:\/\/doi.org\/10.1007\/BF02165411","journal-title":"Numer. Math."},{"key":"3_CR68","unstructured":"development team, T.F.: fplll, a lattice reduction library, Version: 5.5.0 (2024). https:\/\/github.com\/fplll\/fplll"},{"key":"3_CR69","doi-asserted-by":"publisher","unstructured":"Villard, G.: Parallel lattice basis reduction. In: Papers from the International Symposium on Symbolic and Algebraic Computation, ISSAC 1992, pp. 269\u2013277. ACM, New York, United States, August 1992. https:\/\/doi.org\/10.1145\/143242.143327","DOI":"10.1145\/143242.143327"}],"updated-by":[{"DOI":"10.1007\/978-981-95-5099-9_17","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000}}],"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_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T17:49:07Z","timestamp":1770659347000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-5099-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,8]]},"ISBN":["9789819550982","9789819550999"],"references-count":69,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-5099-9_3","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":"8 December 2025","order":2,"name":"change_date","label":"Change Date","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Correction","order":3,"name":"change_type","label":"Change Type","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"A correction has been published.","order":4,"name":"change_details","label":"Change Details","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"}}]}}