{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T04:26:42Z","timestamp":1778128002541,"version":"3.51.4"},"publisher-location":"Singapore","reference-count":23,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819608935","type":"print"},{"value":"9789819608942","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T00:00:00Z","timestamp":1734048000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T00:00:00Z","timestamp":1734048000000},"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-981-96-0894-2_12","type":"book-chapter","created":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T00:48:28Z","timestamp":1734050908000},"page":"359-385","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Cryptanalysis of\u00a0Rank-2 Module-LIP with\u00a0Symplectic Automorphisms"],"prefix":"10.1007","author":[{"given":"Hengyi","family":"Luo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaijie","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanbin","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anyu","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,13]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, D., Dadush, D., Regev, O., Stephens-Davidowitz, N.: Solving the shortest vector problem in 2$$ ^{\\text{n}}$$ time using discrete gaussian sampling: Extended abstract. In: Servedio, R.A., Rubinfeld, R. (eds.) Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14-17, 2015. pp. 733\u2013742. ACM (2015), https:\/\/doi.org\/10.1145\/2746539.2746606","DOI":"10.1145\/2746539.2746606"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-031-62743-9_6","volume-title":"Post-Quantum Cryptography","author":"B Ben\u010dina","year":"2024","unstructured":"Ben\u010dina, B., Budroni, A., Chi-Dom\u00ednguez, J.J., Kulkarni, M.: Properties of lattice isomorphism as a cryptographic group action. In: Saarinen, M.J., Smith-Tone, D. (eds.) Post-Quantum Cryptography. pp. 170\u2013201. Springer Nature Switzerland, Cham (2024)"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Bennett, H., Ganju, A., Peetathawatchai, P., Stephens-Davidowitz, N.: Just how hard are rotations of z n? algorithms and cryptography with the simplest lattice. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques. pp. 252\u2013281. Springer (2023)","DOI":"10.1007\/978-3-031-30589-4_9"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Blanks, T.L., Miller, S.D.: Generating cryptographically-strong random lattice bases and recognizing rotations of $${Z}^n$$. In: Post-Quantum Cryptography: 12th International Workshop, PQCrypto 2021, Daejeon, South Korea, July 20\u201322, 2021, Proceedings 12. pp. 319\u2013338. Springer (2021)","DOI":"10.1007\/978-3-030-81293-5_17"},{"key":"12_CR5","unstructured":"Cohen, H.: Advanced topics in computational number theory, chap. The Hermite Normal Form Algorithms in Dedekind Domains, p.\u00a027. Springer (2000), https:\/\/api.semanticscholar.org\/CorpusID:118279568"},{"key":"12_CR6","first-page":"1","volume-title":"Provable lattice reduction of z n with blocksize n\/2","author":"L Ducas","year":"2023","unstructured":"Ducas, L.: Provable lattice reduction of z n with blocksize n\/2. Designs, Codes and Cryptography pp.\u00a01\u20138 (2023)"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Ducas, L., Gibbons, S.: Hull attacks on the lattice isomorphism problem. In: IACR International Conference on Public-Key Cryptography. pp. 177\u2013204. Springer (2023)","DOI":"10.1007\/978-3-031-31368-4_7"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Ducas, L., Postlethwaite, E.W., Pulles, L.N., van Woerden, W.P.J.: Hawk: Module LIP makes lattice signatures fast, compact and simple. In: Agrawal, S., Lin, D. (eds.) Advances in Cryptology - ASIACRYPT 2022 - 28th International Conference on the Theory and Application of Cryptology and Information Security, Taipei, Taiwan, December 5-9, 2022, Proceedings, Part IV. Lecture Notes in Computer Science, vol. 13794, pp. 65\u201394. Springer (2022), https:\/\/doi.org\/10.1007\/978-3-031-22972-5_3","DOI":"10.1007\/978-3-031-22972-5_3"},{"key":"12_CR9","doi-asserted-by":"crossref","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.) Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30 - June 3, 2022, Proceedings, Part III. Lecture Notes in Computer Science, vol. 13277, pp. 643\u2013673. Springer (2022), https:\/\/doi.org\/10.1007\/978-3-031-07082-2_23","DOI":"10.1007\/978-3-031-07082-2_23"},{"issue":"1","key":"12_CR10","doi-asserted-by":"publisher","first-page":"179","DOI":"10.2140\/obs.2020.4.179","volume":"4","author":"M Dutour Sikiri\u0107","year":"2020","unstructured":"Dutour\u00a0Sikiri\u0107, M., Haensch, A., Voight, J., van Woerden, W.P.: A canonical form for positive definite matrices. Open Book Series 4(1), 179\u2013195 (2020)","journal-title":"Open Book Series"},{"key":"12_CR11","doi-asserted-by":"publisher","unstructured":"Felderhoff, J., Pellet-Mary, A., Stehl\u00e9, D., Wesolowski, B.: Ideal-SVP is Hard for\u00a0Small-Norm Uniform Prime Ideals. In: Theory of Cryptography, TCC 2023. Lecture Notes in Computer Science, vol. 14372, pp. 63\u201392. Springer Nature Switzerland, Taipei (Taiwan), Taiwan (Dec 2023). https:\/\/doi.org\/10.1007\/978-3-031-48624-1_3, https:\/\/hal.science\/hal-04326750","DOI":"10.1007\/978-3-031-48624-1_3"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Gei\u00dfler, K., Smart, N.P.: Computing the M = U U$$ ^{\\text{ t }}$$ integer matrix decomposition. In: Paterson, K.G. (ed.) Cryptography and Coding, 9th IMA International Conference, Cirencester, UK, December 16-18, 2003, Proceedings. Lecture Notes in Computer Science, vol.\u00a02898, pp. 223\u2013233. Springer (2003), https:\/\/doi.org\/10.1007\/978-3-540-40974-8_18","DOI":"10.1007\/978-3-540-40974-8_18"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Gentry, C., Szydlo, M.: Cryptanalysis of the revised NTRU signature scheme. In: Knudsen, L.R. (ed.) Advances in Cryptology - EUROCRYPT 2002, International Conference on the Theory and Applications of Cryptographic Techniques, Amsterdam, The Netherlands, April 28 - May 2, 2002, Proceedings. Lecture Notes in Computer Science, vol.\u00a02332, pp. 299\u2013320. Springer (2002), https:\/\/doi.org\/10.1007\/3-540-46035-7_20","DOI":"10.1007\/3-540-46035-7_20"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Haviv, I., Regev, O.: On the lattice isomorphism problem. In: Chekuri, C. (ed.) Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5-7, 2014. pp. 391\u2013404. SIAM (2014), https:\/\/doi.org\/10.1137\/1.9781611973402.29","DOI":"10.1137\/1.9781611973402.29"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Hoffstein, J., Howgrave-Graham, N., Pipher, J., Silverman, J.H., Whyte, W.: NTRUSIGN: digital signatures using the NTRU lattice. In: Joye, M. (ed.) Topics in Cryptology - CT-RSA 2003, The Cryptographers\u2019 Track at the RSA Conference 2003, San Francisco, CA, USA, April 13-17, 2003, Proceedings. Lecture Notes in Computer Science, vol.\u00a02612, pp. 122\u2013140. Springer (2003), https:\/\/doi.org\/10.1007\/3-540-36563-X_9","DOI":"10.1007\/3-540-36563-X_9"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Jiang, K., Wang, A., Luo, H., Liu, G., Yu, Y., Wang, X.: Exploiting the symmetry of $$\\mathbb{Z}^n$$: Randomization and the automorphism problem. In: Guo, J., Steinfeld, R. (eds.) Advances in Cryptology \u2013 ASIACRYPT 2023. pp. 167\u2013200. Springer Nature Singapore, Singapore (2023)","DOI":"10.1007\/978-981-99-8730-6_6"},{"key":"12_CR17","doi-asserted-by":"publisher","unstructured":"Jr., H.W.L., Silverberg, A.: Revisiting the gentry-szydlo algorithm. In: Garay, J.A., Gennaro, R. (eds.) Advances in Cryptology - CRYPTO 2014 - 34th Annual Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2014, Proceedings, Part I. Lecture Notes in Computer Science, vol.\u00a08616, pp. 280\u2013296. Springer (2014), https:\/\/doi.org\/10.1007\/978-3-662-44371-2_16","DOI":"10.1007\/978-3-662-44371-2_16"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Jr., H.W.L., Silverberg, A.: Lattices with symmetry. J. Cryptol. 30(3), 760\u2013804 (2017), https:\/\/doi.org\/10.1007\/s00145-016-9235-7","DOI":"10.1007\/s00145-016-9235-7"},{"issue":"4","key":"12_CR19","doi-asserted-by":"publisher","first-page":"1300","DOI":"10.1137\/17M115390X","volume":"48","author":"HW Lenstra Jr","year":"2019","unstructured":"Lenstra\u00a0Jr, H.W., Silverberg, A.: Testing isomorphism of lattices over cm-orders. SIAM Journal on Computing 48(4), 1300\u20131334 (2019)","journal-title":"SIAM Journal on Computing"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Mureau, G., Pellet-Mary, A., Pliatsok, G., Wallet, A.: Cryptanalysis of rank-2 module-lip in totally real number fields. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques. pp. 226\u2013255. Springer (2024)","DOI":"10.1007\/978-3-031-58754-2_9"},{"key":"12_CR21","unstructured":"NIST: Post-quantum cryptography: digital signature schemes. round 1 additional signatures (2023)"},{"issue":"3\u20134","key":"12_CR22","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1006\/jsco.1996.0130","volume":"24","author":"W Plesken","year":"1997","unstructured":"Plesken, W., Souvignier, B.: Computing isometries of lattices. Journal of Symbolic Computation 24(3-4), 327\u2013334 (1997)","journal-title":"Journal of Symbolic Computation"},{"key":"12_CR23","doi-asserted-by":"publisher","unstructured":"Szydlo, M.: Hypercubic lattice reduction and analysis of GGH and NTRU signatures. In: Biham, E. (ed.) Advances in Cryptology - EUROCRYPT 2003, International Conference on the Theory and Applications of Cryptographic Techniques, Warsaw, Poland, May 4-8, 2003, Proceedings. Lecture Notes in Computer Science, vol.\u00a02656, pp. 433\u2013448. Springer (2003), https:\/\/doi.org\/10.1007\/3-540-39200-9_27","DOI":"10.1007\/3-540-39200-9_27"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0894-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T01:04:46Z","timestamp":1734051886000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0894-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,13]]},"ISBN":["9789819608935","9789819608942"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0894-2_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,13]]},"assertion":[{"value":"13 December 2024","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":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}