{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:00:04Z","timestamp":1743123604849,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031757631"},{"type":"electronic","value":"9783031757648"}],"license":[{"start":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T00:00:00Z","timestamp":1729123200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T00:00:00Z","timestamp":1729123200000},"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-031-75764-8_2","type":"book-chapter","created":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T11:03:12Z","timestamp":1729594992000},"page":"24-40","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Deep LLL on\u00a0Module Lattices"],"prefix":"10.1007","author":[{"given":"Yang","family":"Zhou","sequence":"first","affiliation":[]},{"given":"Heyang","family":"Cao","sequence":"additional","affiliation":[]},{"given":"Mingsheng","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,10,17]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","unstructured":"Akhavi, A.: The optimal LLL algorithm is still polynomial in fixed dimension. Theor. Comput. Sci. 297(1), 3\u201323 (2003). https:\/\/doi.org\/10.1016\/S0304-3975(02)00616-3, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397502006163. Latin American Theoretical Informatics","DOI":"10.1016\/S0304-3975(02)00616-3"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/978-3-030-64834-3_12","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"O Bernard","year":"2020","unstructured":"Bernard, O., Roux-Langlois, A.: Twisted-PHS: using the product formula to solve approx-SVP in ideal lattices. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12492, pp. 349\u2013380. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_12"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Beullens, W., Lyubashevsky, V., Nguyen, N.K., Seiler, G.: Lattice-based blind signatures: short, efficient, and round-optimal. In: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, pp. 16\u201329 (2023)","DOI":"10.1145\/3576915.3616613"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Biasse, J.F., Song, F.: Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, pp. 893\u2013902. Society for Industrial and Applied Mathematics, USA (2016)","DOI":"10.1137\/1.9781611974331.ch64"},{"key":"2_CR5","doi-asserted-by":"publisher","unstructured":"Biasse, J.F., Fieker, C., Hofmann, T.: On the computation of the HNF of a module over the ring of integers of a number field. J. Symb. Comput. 80, 581\u2013615 (2017). https:\/\/doi.org\/10.1016\/j.jsc.2016.07.027 , https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0747717116300736","DOI":"10.1016\/j.jsc.2016.07.027"},{"key":"2_CR6","doi-asserted-by":"publisher","unstructured":"Bos, J., et al.: Crystals - kyber: a CCA-secure module-lattice-based KEM. In: 2018 IEEE European Symposium on Security and Privacy (EuroS &P), pp. 353\u2013367 (2018). https:\/\/doi.org\/10.1109\/EuroSP.2018.00032","DOI":"10.1109\/EuroSP.2018.00032"},{"key":"2_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8489-0","volume-title":"Advanced Topics in Computational Number Theory","author":"H Cohen","year":"1999","unstructured":"Cohen, H.: Advanced Topics in Computational Number Theory. Springer, New York (1999). https:\/\/doi.org\/10.1007\/978-1-4419-8489-0"},{"key":"2_CR8","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. LNCS, vol. 9666, pp. 559\u2013585. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_20"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-319-56620-7_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"R Cramer","year":"2017","unstructured":"Cramer, R., Ducas, L., Wesolowski, B.: Short stickelberger class relations and application to ideal-SVP. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10210, pp. 324\u2013348. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_12"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"836","DOI":"10.1007\/978-3-031-38554-4_27","volume-title":"Advances in Cryptology - CRYPTO 2023","author":"G De Micheli","year":"2023","unstructured":"De Micheli, G., Micciancio, D., Pellet-Mary, A., Tran, N.: Reductions from module lattices to free module lattices, and application to dequantizing module-LLL. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023. LNCS, vol. 14085, pp. 836\u2013865. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_27"},{"key":"2_CR11","doi-asserted-by":"publisher","unstructured":"Ducas, L., et al.: Crystals-Dilithium: a lattice-based digital signature scheme. IACR Trans. Cryptogr. Hardw. Embed. Systems pp. 238\u2013268 (2018). https:\/\/doi.org\/10.46586\/tches.v2018.i1.238-268","DOI":"10.46586\/tches.v2018.i1.238-268"},{"key":"2_CR12","doi-asserted-by":"publisher","unstructured":"Eisentr\u00e4ger, K., Hallgren, S., Kitaev, A., Song, F.: A quantum algorithm for computing the unit group of an arbitrary degree number field. In: Proceedings of the Forty-Sixth Annual ACM Symposium on Theory of Computing, STOC 2014, pp. 293\u2013302. Association for Computing Machinery, New York (2014). https:\/\/doi.org\/10.1145\/2591796.2591860","DOI":"10.1145\/2591796.2591860"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/3-540-61581-4_48","volume-title":"Algorithmic Number Theory","author":"C Fieker","year":"1996","unstructured":"Fieker, C., Pohst, M.E.: On lattices over number fields. In: Cohen, H. (ed.) ANTS 1996. LNCS, vol. 1122, pp. 133\u2013139. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61581-4_48"},{"key":"2_CR14","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":"2_CR15","unstructured":"Fouque, P.A., et al.: Falcon: fast-Fourier lattice-based compact signatures over NTRU. Submission to the NIST\u2019s Post-quantum Cryptogr. Stand. Process 36(5), 1\u201375 (2018)"},{"key":"2_CR16","unstructured":"Kaiblinger, N.: Cyclotomic rings with simple Euclidean algorithm. JP J. Algebra Number Theory Appl. 23 (2011)"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-319-71045-7_19","volume-title":"Cryptography and Coding","author":"T Kim","year":"2017","unstructured":"Kim, T., Lee, C.: Lattice reductions over Euclidean rings with applications to cryptanalysis. In: O\u2019Neill, M. (ed.) IMACC 2017. LNCS, vol. 10655, pp. 371\u2013391. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-71045-7_19"},{"key":"2_CR18","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. LNCS, vol. 11922, pp. 59\u201390. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34621-8_3"},{"key":"2_CR19","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.: Factoring polynomials with rational coefficients. Math. Ann. 261, 515\u2013534 (1982)","journal-title":"Math. Ann."},{"key":"2_CR20","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. LNCS, vol. 12171, pp. 213\u2013242. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_8"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Napias, H.: A generalization of the LLL-algorithm over Euclidean rings or orders. J. Theorie Nombres Bordeaux 8, 387\u2013396 (1996). https:\/\/api.semanticscholar.org\/CorpusID:54954327","DOI":"10.5802\/jtnb.176"},{"key":"2_CR22","unstructured":"Odagawa, T., Nuida, K.: Halt properties and complexity evaluations for optimal DeepLLL algorithm families. arXiv preprint arXiv:2105.14695 (2021)"},{"key":"2_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/978-3-030-77870-5_20","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"Y Pan","year":"2021","unstructured":"Pan, Y., Xu, J., Wadleigh, N., Cheng, Q.: On the ideal shortest vector problem over random rational primes. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021, Part I. LNCS, vol. 12696, pp. 559\u2013583. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_20"},{"key":"2_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1007\/978-3-030-17656-3_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"A Pellet-Mary","year":"2019","unstructured":"Pellet-Mary, A., Hanrot, G., Stehl\u00e9, D.: Approx-SVP in ideal lattices with pre-processing. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11477, pp. 685\u2013716. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_24"},{"key":"2_CR25","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01581144","volume":"66","author":"CP 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."},{"key":"2_CR26","unstructured":"T.U, D.: SVP challenge"},{"key":"2_CR27","doi-asserted-by":"publisher","unstructured":"Yasuda, M., Yamaguchi, J.: A new polynomial-time variant of LLL with deep insertions for decreasing the squared-sum of gram-Schmidt lengths. Des. Codes Cryptogr. 87(11), 2489-2505 (2019). https:\/\/doi.org\/10.1007\/s10623-019-00634-9","DOI":"10.1007\/s10623-019-00634-9"}],"container-title":["Lecture Notes in Computer Science","Information Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-75764-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T11:06:20Z","timestamp":1729595180000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-75764-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,17]]},"ISBN":["9783031757631","9783031757648"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-75764-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,10,17]]},"assertion":[{"value":"17 October 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Arlington, VA","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 October 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isw2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/isc24.cs.gmu.edu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}