{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T05:40:07Z","timestamp":1752471607579,"version":"3.41.2"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031972591","type":"print"},{"value":"9783031972607","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T00:00:00Z","timestamp":1751414400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T00:00:00Z","timestamp":1751414400000},"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-3-031-97260-7_8","type":"book-chapter","created":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T05:20:46Z","timestamp":1752470446000},"page":"147-163","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Improvement of\u00a0the\u00a0Congruence Solver of\u00a0Lattice Isomorphism Problem over\u00a0Totally Real Number Fields and\u00a0Applications"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7820-1345","authenticated-orcid":false,"given":"Nour-eddine","family":"Rahmani","sequence":"first","affiliation":[]},{"given":"Taoufik","family":"Serraj","sequence":"additional","affiliation":[]},{"given":"Moulay Chrif","family":"Ismaili","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,7,2]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/978-3-030-64834-3_20","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"MR Albrecht","year":"2020","unstructured":"Albrecht, M.R., Gheorghiu, V., Postlethwaite, E.W., Schanck, J.M.: Estimating quantum speedups for lattice sieves. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12492, pp. 583\u2013613. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_20"},{"key":"8_CR2","unstructured":"Alkim, E., Ducas, L., P\u00f6ppelmann, T., Schwabe, P.: Post-quantum key exchange - a new hope. In: USENIX Security Symposium, pp. 327\u2013343. USENIX Association (2016)"},{"key":"8_CR3","doi-asserted-by":"publisher","unstructured":"Allombert, B., Pellet-Mary, A., van Woerden, W.: Cryptanalysis of rank-2 module-LIP: a single real embedding is all it takes. In: Fehr, S., Fouque, PA. (eds.) EUROCRYPT 2025. LNCS, vol. 15602, pp. 184\u2013212. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-91124-8_7","DOI":"10.1007\/978-3-031-91124-8_7"},{"key":"8_CR4","doi-asserted-by":"publisher","unstructured":"Babai, L.: On Lov\u00e1sz\u2019 lattice reduction and the nearest lattice point problem. In: Proceedings of the 18th Annual ACM Symposium on Theory of Computing (STOC), pp. 13\u201320. ACM (1986). https:\/\/doi.org\/10.1145\/12130.12134","DOI":"10.1145\/12130.12134"},{"key":"8_CR5","doi-asserted-by":"publisher","unstructured":"Ben\u010dina, B., Budroni, A., Chi-Dom\u00ednguez, JJ., Kulkarni, M.: Properties of lattice isomorphism as a cryptographic group action. In: Saarinen, MJ., Smith-Tone, D. (eds.) PQCrypto 2024. LNCS, vol. 14771, pp. 170\u2013201. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-62743-9_6","DOI":"10.1007\/978-3-031-62743-9_6"},{"key":"8_CR6","doi-asserted-by":"publisher","unstructured":"Bennett, H., Ganju, A., Peetathawatchai, P., Stephens-Davidowitz, N.: Just how hard are rotations of $$\\mathbb{Z}^n$$? Algorithms and cryptography with the simplest lattice. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023. LNCS, vol. 14008, pp. 252\u2013281. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_9","DOI":"10.1007\/978-3-031-30589-4_9"},{"key":"8_CR7","doi-asserted-by":"publisher","unstructured":"Bos, J., et al.: CRYSTALS - Kyber: a module-lattice-based KEM. In: 2018 IEEE European Symposium on Security and Privacy (EuroS &P), pp. 353\u2013367. IEEE (2018). https:\/\/doi.org\/10.1109\/EuroSP.2018.00032","DOI":"10.1109\/EuroSP.2018.00032"},{"key":"8_CR8","doi-asserted-by":"publisher","unstructured":"Chevignard, C., Mureau, G., Espitau, T., Pellet-Mary, A., Pliatsok, H., Wallet, A.: A reduction from hawk to the principal ideal problem in a quaternion algebra. In: Fehr, S., Fouque, PA. (eds.) EUROCRYPT 2025. LNCS, vol. 15602, pp. 154\u2013183. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-91124-8_6","DOI":"10.1007\/978-3-031-91124-8_6"},{"key":"8_CR9","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. LNCS, vol. 12171, pp. 329\u2013358. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_12"},{"key":"8_CR10","unstructured":"Ducas, L., Lepoint, T., Lyubashevsky, V., Schwabe, P., Seiler, G., Stehl\u00e9, D.: Crystals-Dilithium: digital signatures from module lattices (2018)"},{"key":"8_CR11","doi-asserted-by":"publisher","unstructured":"Ducas, L., van Woerden, W.: On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022. LNCS, vol. 13277, pp. 643\u2013673. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07082-2_23","DOI":"10.1007\/978-3-031-07082-2_23"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Ducas, L., Postlethwaite, E.W., Pulles, L.N., van Woerden, W.: Hawk: module LIP makes lattice signatures fast, compact, and simple. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 65\u201394. Springer (2022)","DOI":"10.1007\/978-3-031-22972-5_3"},{"key":"8_CR13","unstructured":"Fouque, P.-A., et al.: Falcon: fast-Fourier lattice-based compact signatures over NTRU. Submission NIST\u2019s Post-Quantum Cryptogr. Stand. Process 36(5), 1\u201375 (2018)"},{"key":"8_CR14","doi-asserted-by":"publisher","unstructured":"Guerreau, M., Rossi, M.: A not so discrete sampler: power analysis attacks on HAWK signature scheme. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2024(4), 156\u2013178 (2024). https:\/\/doi.org\/10.46586\/tches.v2024.i4.156-178","DOI":"10.46586\/tches.v2024.i4.156-178"},{"key":"8_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"},{"issue":"3","key":"8_CR16","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s10623-014-9938-4","volume":"75","author":"A Langlois","year":"2014","unstructured":"Langlois, A., Stehl\u00e9, D.: Worst-case to average-case reductions for module lattices. Des. Codes Crypt. 75(3), 565\u2013599 (2014). https:\/\/doi.org\/10.1007\/s10623-014-9938-4","journal-title":"Des. Codes Crypt."},{"issue":"4","key":"8_CR17","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(4), 515\u2013534 (1982). https:\/\/doi.org\/10.1007\/BF01457454","journal-title":"Math. Ann."},{"key":"8_CR18","doi-asserted-by":"publisher","unstructured":"Luo, H., Jiang, K., Pan, Y., Wang, A.: Cryptanalysis of rank-2 module-LIP with symplectic automorphisms. In: Chung, K.M., Sasaki, Y. (eds.) ASIACRYPT 2024. LNCS, vol. 15487, pp. 359\u2013385. Springer, Singapore (2024). https:\/\/doi.org\/10.1007\/978-981-96-0894-2_12","DOI":"10.1007\/978-981-96-0894-2_12"},{"key":"8_CR19","doi-asserted-by":"publisher","unstructured":"Mureau, G., Pellet-Mary, A., Pliatsok, G., Wallet, A.: Cryptanalysis of rank-2 module-LIP in totally real number fields. In: Joye, M., Leander, G. (eds.) EUROCRYPT 2024. LNCS, vol. 14657, pp. 226\u2013255. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58754-2_9","DOI":"10.1007\/978-3-031-58754-2_9"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"National Institute of Standards and Technology. Module-Lattice-Based Key Encapsulation Mechanism Standard. Federal Information Processing Standards Publication (FIPS) NIST FIPS 203. Washington, D.C. (2024). https:\/\/doi.org\/10.6028\/NIST.FIPS.203","DOI":"10.6028\/NIST.FIPS.203"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"National Institute of Standards and Technology. Module-Lattice-Based Digital Signature Standard. Federal Information Processing Standards Publication (FIPS) NIST FIPS 204. Washington, D.C. (2024). https:\/\/doi.org\/10.6028\/NIST.FIPS.204","DOI":"10.6028\/NIST.FIPS.204"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"National Institute of Standards and Technology. Stateless Hash-Based Digital Signature Standard. Federal Information Processing Standards Publication (FIPS) NIST FIPS 205. Washington, D.C. (2024). https:\/\/doi.org\/10.6028\/NIST.FIPS.205","DOI":"10.6028\/NIST.FIPS.205"},{"issue":"1","key":"8_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3708471","volume":"72","author":"O Regev","year":"2025","unstructured":"Regev, O.: An efficient quantum factoring algorithm. J. ACM 72(1), 1\u201313 (2025). https:\/\/doi.org\/10.1145\/3708471. Article 10","journal-title":"J. ACM"},{"key":"8_CR24","doi-asserted-by":"publisher","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pp. 124\u2013134. IEEE (1994). https:\/\/doi.org\/10.1109\/SFCS.1994.365700","DOI":"10.1109\/SFCS.1994.365700"},{"key":"8_CR25","unstructured":"The PARI Group: PARI\/GP version 2.15.4. Univ. Bordeaux (2023). http:\/\/pari.math.u-bordeaux.fr\/"},{"key":"8_CR26","unstructured":"The Sage Developers: SageMath, the Sage Mathematics Software System (Version 10.4) (2024). https:\/\/www.sagemath.org"},{"key":"8_CR27","doi-asserted-by":"crossref","unstructured":"Washington, L.C.: Introduction to Cyclotomic Fields. Graduate Texts in Mathematics, vol. 83. Springer (1997). 978-0387947628","DOI":"10.1007\/978-1-4612-1934-7"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology - AFRICACRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-97260-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T05:20:49Z","timestamp":1752470449000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-97260-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,2]]},"ISBN":["9783031972591","9783031972607"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-97260-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,2]]},"assertion":[{"value":"2 July 2025","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":"Rabat","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","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":"21 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"africacrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/africacrypt2025.sciencesconf.org","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}