{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T22:33:31Z","timestamp":1775774011291,"version":"3.50.1"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031643804","type":"print"},{"value":"9783031643811","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-64381-1_18","type":"book-chapter","created":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T23:01:56Z","timestamp":1719961316000},"page":"403-427","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Finding Dense Submodules with\u00a0Algebraic Lattice Reduction"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Karenin","sequence":"first","affiliation":[]},{"given":"Elena","family":"Kirshanova","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,3]]},"reference":[{"key":"18_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. LNCS, vol. 9814, pp. 153\u2013178. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_6"},{"issue":"4","key":"18_CR2","doi-asserted-by":"publisher","first-page":"407","DOI":"10.3934\/amc.2014.8.407","volume":"8","author":"JF Biasse","year":"2014","unstructured":"Biasse, J.F.: Subexponential time relations in the class group of large degree number fields. Adv. Math. Commun. 8(4), 407\u2013425 (2014)","journal-title":"Adv. Math. Commun."},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-319-56620-7_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"J-F Biasse","year":"2017","unstructured":"Biasse, J.-F., Espitau, T., Fouque, P.-A., G\u00e9lin, A., Kirchner, P.: Computing generator in cyclotomic integer rings. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10210, pp. 60\u201388. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_3"},{"key":"18_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, pp. 893\u2013902. SIAM (2016)","DOI":"10.1137\/1.9781611974331.ch64"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-030-56880-1_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"K de Boer","year":"2020","unstructured":"de Boer, K., Ducas, L., Pellet-Mary, A., Wesolowski, B.: Random self-reducibility of ideal-SVP via Arakelov random walks. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 243\u2013273. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_9"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Bos, J.W., et al.: CRYSTALS - Kyber: a CCA-secure module-lattice-based KEM. In: 2018 IEEE EuroS &P, pp. 353\u2013367 (2018)","DOI":"10.1109\/EuroSP.2018.00032"},{"key":"18_CR7","unstructured":"Chen, C., et al.: PQC round-3 candidate: NTRU. Technical report (2019). https:\/\/ntru.org\/f\/ntru-20190330.pdf"},{"key":"18_CR8","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":"18_CR9","volume-title":"Advanced Topics in Computational Number Theory","author":"H Cohen","year":"2012","unstructured":"Cohen, H.: Advanced Topics in Computational Number Theory, vol. 193. Springer, Heidelberg (2012)"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/3-540-69053-0_5","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201997","author":"D Coppersmith","year":"1997","unstructured":"Coppersmith, D., Shamir, A.: Lattice attacks on NTRU. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 52\u201361. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-69053-0_5"},{"key":"18_CR11","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. LNCS, vol. 13093, pp. 3\u201332. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92068-5_1"},{"issue":"1","key":"18_CR12","doi-asserted-by":"publisher","first-page":"238","DOI":"10.46586\/tches.v2018.i1.238-268","volume":"2018","author":"L Ducas","year":"2018","unstructured":"Ducas, L., et al.: CRYSTALS-Dilithium: a lattice-based digital signature scheme. IACR Trans. Cryptogr. Hardw. Embedded Syst. 2018(1), 238\u2013268 (2018)","journal-title":"IACR Trans. Cryptogr. Hardw. Embedded Syst."},{"key":"18_CR13","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":"18_CR14","unstructured":"Fouque, P.A., et al.: FALCON: fast-Fourier lattice-based compact signatures over NTRU (2018). https:\/\/www.di.ens.fr\/~prest\/Publications\/falcon.pdf"},{"key":"18_CR15","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":"18_CR16","unstructured":"Karenin, A., Kirshanova, E.: Finding dense submodules with algebraic lattice reduction. Cryptology ePrint Archive, Paper 2024\/844 (2024). https:\/\/eprint.iacr.org\/2024\/844"},{"key":"18_CR17","unstructured":"Kirchner, P., Espitau, T., Fouque, P.A.: Algebraic and Euclidean lattices: optimal lattice reduction and beyond. Cryptology ePrint Archive, Paper 2019\/1436 (2019). https:\/\/eprint.iacr.org\/2019\/1436"},{"key":"18_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-030-56880-1_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"P Kirchner","year":"2020","unstructured":"Kirchner, P., Espitau, T., Fouque, P.-A.: Fast reduction of algebraic lattices over cyclotomic fields. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 155\u2013185. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_6"},{"key":"18_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-56620-7_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"P Kirchner","year":"2017","unstructured":"Kirchner, P., Fouque, P.-A.: Revisiting lattice attacks on overstretched NTRU parameters. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10210, pp. 3\u201326. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_1"},{"key":"18_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-031-40003-2_7","volume-title":"Post-Quantum Cryptography","author":"E Kirshanova","year":"2023","unstructured":"Kirshanova, E., May, A., Nowakowski, J.: New NTRU records with improved lattice bases. In: Johansson, T., Smith-Tone, D. (eds.) PQCrypto 2023. LNCS, vol. 14154, pp. 167\u2013195. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-40003-2_7"},{"issue":"3","key":"18_CR21","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s10623-014-9938-4","volume":"75","author":"A Langlois","year":"2015","unstructured":"Langlois, A., Stehl\u00e9, D.: Worst-case to average-case reductions for module lattices. Des. Codes Crypt. 75(3), 565\u2013599 (2015)","journal-title":"Des. Codes Crypt."},{"key":"18_CR22","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":"18_CR23","doi-asserted-by":"crossref","unstructured":"Lenstra, A.K., Lenstra, H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Math. Ann. 261(ARTICLE), 515\u2013534 (1982)","DOI":"10.1007\/BF01457454"},{"key":"18_CR24","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1137\/070705702","volume":"39","author":"P Nguyen","year":"2009","unstructured":"Nguyen, P., Stehl\u00e9, D.: An LLL algorithm with quadratic complexity. SIAM J. Comput. 39, 874\u2013903 (2009)","journal-title":"SIAM J. Comput."},{"key":"18_CR25","unstructured":"Pataki, G., Tural, M.: On sublattice determinants in reduced bases. arXiv preprint arXiv:0804.4014 (2008)"},{"key":"18_CR26","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-3975(87)90064-8","volume":"53","author":"C Schnorr","year":"1987","unstructured":"Schnorr, C.: A hierarchy of polynomial time lattice basis reduction algorithms. Theor. Comput. Sci. 53, 201\u2013224 (1987)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR27","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":"18_CR28","unstructured":"The FPLLL Development Team: FPyLLL, a Python wrapper for the FPLLL lattice reduction library, Version: 0.6.1 (2023). https:\/\/github.com\/fplll\/fpylll"},{"key":"18_CR29","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-0133-2","volume-title":"Introduction to Cyclotomic Fields","author":"LC Washington","year":"1982","unstructured":"Washington, L.C.: Introduction to Cyclotomic Fields. Graduate Texts in Mathematics, vol. 83. Springer, New York (1982). https:\/\/doi.org\/10.1007\/978-1-4684-0133-2"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology - AFRICACRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-64381-1_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T23:04:12Z","timestamp":1719961452000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-64381-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031643804","9783031643811"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-64381-1_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"3 July 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AFRICACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in Africa","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Douala","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cameroon","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":"10 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"africacrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}