{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T15:48:27Z","timestamp":1787759307210,"version":"build-2784847793"},"reference-count":16,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2026,3,1]]},"DOI":"10.1587\/transfun.2025cip0017","type":"journal-article","created":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:07:55Z","timestamp":1757628475000},"page":"167-175","source":"Crossref","is-referenced-by-count":1,"title":["On Lattice Isomorphism Problems for Lattices from LCD Codes over Finite Rings"],"prefix":"10.1587","volume":"E109.A","author":[{"given":"Yusaku","family":"NISHIMURA","sequence":"first","affiliation":[{"name":"School of Fundamental Science and Engineering, Waseda University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Katsuyuki","family":"TAKASHIMA","sequence":"additional","affiliation":[{"name":"Faculty of Education and Integrated Arts and Sciences, School of Education, Waseda University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tsuyoshi","family":"MIEZAKI","sequence":"additional","affiliation":[{"name":"Faculty of Science and Engineering, Waseda University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] B. Allombert, A. Pellet-Mary, and W. van Woerden, \u201cCryptanalysis of rank-2 module-LIP: A single real embedding is all it takes,\u201d Advances in Cryptology - EUROCRYPT 2025, Proceedings, Part II, 184-212, 2025. 10.1007\/978-3-031-91124-8_7","DOI":"10.1007\/978-3-031-91124-8_7"},{"key":"2","unstructured":"[2] L. Babai, \u201cGraph isomorphism in quasipolynomial time,\u201d 2015. http:\/\/arxiv.org\/abs\/1512.03547"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] M. Bardet, A. Otmani, and M.A. Saeed, \u201cPermutation code equivalence is not harder than graph isomorphism when hulls are trivial,\u201d 2019 IEEE International Symposium on Information Theory (ISIT), pp.2464-2468, 2019. 10.1109\/isit.2019.8849855","DOI":"10.1109\/ISIT.2019.8849855"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] C. Chevignard, G. Mureau, T. Espitau, A. Pellet-Mary, H. Pliatsok, and A. Wallet, \u201cA reduction from hawk to the principal ideal problem in a quaternion algebra,\u201d Advances in Cryptology - EUROCRYPT 2025, Proceedings, Part II, pp.154-183, 2025. 10.1007\/978-3-031-91124-8_6","DOI":"10.1007\/978-3-031-91124-8_6"},{"key":"5","unstructured":"[5] J.H. Conway and N.J.A. Sloane, Sphere Packings, Lattices and Groups, 3rd ed., with additional contributions by E. Bannai, R.E. Borcherds, J. Leech, S.P. Norton, A.M. Odlyzko, R.A. Parker, L. Queen and B.B. Venkov, Grundlehren Math. Wiss., vol.290 [Fundamental Principles of Mathematical Sciences] Springer-Verlag, New York, 1999. 10.1007\/978-1-4757-6568-7"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] L. Ducas, E.W. Postlethwaite, L.N. Pulles, and W. van Woerden, \u201cHawk: Module LIP makes lattice signatures fast, compact and simple,\u201d Advances in Cryptology - ASIACRYPT 2022, Proceedings, Part IV, pp.65-94, 2022. 10.1007\/978-3-031-22972-5_3","DOI":"10.1007\/978-3-031-22972-5_3"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] L. Ducas and S. Gibbons, \u201cHull attacks on the lattice isomorphism problem,\u201d Public-Key Cryptography - PKC 2023, pp.177-204, 2023. 10.1007\/978-3-031-31368-4_7","DOI":"10.1007\/978-3-031-31368-4_7"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] L. Ducas and W. van Woerden, \u201cOn the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography,\u201d Advances in Cryptology - EUROCRYPT 2022, Proceedings, Part III, pp.643-673, 2022. 10.1007\/978-3-031-07082-2_23","DOI":"10.1007\/978-3-031-07082-2_23"},{"key":"9","unstructured":"[9] Y. Dur\u01e7un, \u201cOn LCD codes over finite chain rings,\u201d Bull. Korean Math. Soc., vol.57, no.1, pp.37-50, 2020. 10.4134\/BKMS.b181173"},{"key":"10","unstructured":"[10] J.W. Bos, O. Bronchain, L. Ducas, S. Fehr, Y.-H. Huang, T. Pornin, E.W. Postlethwait, T. Prest, L.N. Pulles, and W. van Woerden, \u201cHAWK version 1.1,\u201d 2025. https:\/\/hawk-sign.info"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] T. Honold and I. Landjev, \u201cLinear codes over finite chain rings,\u201d Electr. J. Comb., vol.7, R11, 2000. 10.37236\/1489","DOI":"10.37236\/1489"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] X. Liu and H. Liu, \u201cLCD codes over finite chain rings,\u201d Finite Fields and Their Applications, vol.34, pp.1-19, 2015. 10.1016\/j.ffa.2015.01.004","DOI":"10.1016\/j.ffa.2015.01.004"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] G. Mureau, A. Pellet-Mary, H. Pliatsok, and A. Wallet, \u201cCryptanalysis of rank-2 module-LIP in totally real number fields,\u201d Advances in Cryptology - EUROCRYPT 2024, Proceedings, Part VI, pp.226-255, 2024. 10.1007\/978-3-031-58754-2_9","DOI":"10.1007\/978-3-031-58754-2_9"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] M.D. Sikiri\u0107, A. Haensch, J. Voight, and W.P.J. van Woerden, \u201cA canonical form for positive definite matrices,\u201d ANTS XIV, Open Book Series, vol.4, pp.179-195, 2020. 10.2140\/obs.2020.4.179","DOI":"10.2140\/obs.2020.4.179"},{"key":"15","unstructured":"[15] N. Sendrier and D. Simos, \u201cHow easy is code equivalence over \ud835\udd3d<sub><i>q<\/i><\/sub>?,\u201d International Workshop on Coding and Cryptography - WCC 2013, April 2013, Bergen, Norway, 2013. https:\/\/hal.inria.fr\/hal-00790861v2"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] N. Sendrier and D.E. Simos, \u201cThe hardness of code equivalence over \ud835\udd3d<sub><i>q<\/i><\/sub> and its application to code-based cryptography,\u201d Post-Quantum Cryptography, pp.203-216, 2013. 10.1007\/978-3-642-38616-9_14","DOI":"10.1007\/978-3-642-38616-9_14"}],"container-title":["IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E109.A\/3\/E109.A_2025CIP0017\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T04:11:02Z","timestamp":1772856662000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E109.A\/3\/E109.A_2025CIP0017\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,1]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2025cip0017","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,1]]},"article-number":"2025CIP0017"}}