{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T01:26:33Z","timestamp":1777857993432,"version":"3.51.4"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031587337","type":"print"},{"value":"9783031587344","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-58734-4_6","type":"book-chapter","created":{"date-parts":[[2024,4,30]],"date-time":"2024-04-30T11:12:08Z","timestamp":1714475528000},"page":"160-187","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Algorithms for\u00a0Matrix Code and\u00a0Alternating Trilinear Form Equivalences via\u00a0New Isomorphism Invariants"],"prefix":"10.1007","author":[{"given":"Anand Kumar","family":"Narayanan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Youming","family":"Qiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gang","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,5,1]]},"reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/978-3-030-64834-3_14","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"N Alamati","year":"2020","unstructured":"Alamati, N., De Feo, L., Montgomery, H., Patranabis, S.: Cryptographic group actions and applications. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12492, pp. 411\u2013439. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_14"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Ambainis, A.: Quantum walk algorithm for element distinctness. SIAM J. Comput. 37(1), 210\u2013239 (2007)","DOI":"10.1137\/S0097539705447311"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Babai, L.: Graph isomorphism in quasipolynomial time [extended abstract]. In: Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, 18\u201321 June 2016, pp. 684\u2013697 (2016)","DOI":"10.1145\/2897518.2897542"},{"key":"6_CR4","doi-asserted-by":"publisher","unstructured":"Babai, L.: Canonical form for graphs in quasipolynomial time: preliminary report. In: Charikar, M., Cohen, E. (eds.) Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, 23\u201326 June 2019, pp. 1237\u20131246. ACM (2019). https:\/\/doi.org\/10.1145\/3313276.3316356","DOI":"10.1145\/3313276.3316356"},{"key":"6_CR5","unstructured":"Baldi, M., et al.: LESS: linear equivalence signature scheme (2023). https:\/\/www.less-project.com\/LESS-2023-08-18.pdf"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-030-64837-4_17","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"M Bardet","year":"2020","unstructured":"Bardet, M., et al.: Improvements of algebraic attacks for solving the rank decoding and MinRank problems. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12491, pp. 507\u2013536. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64837-4_17"},{"key":"6_CR7","doi-asserted-by":"publisher","unstructured":"Bardet, M., Otmani, A., Saeed-Taha, M.: Permutation code equivalence is not harder than graph isomorphism when hulls are trivial. In: 2019 IEEE International Symposium on Information Theory (ISIT), pp. 2464\u20132468. IEEE (2019). https:\/\/doi.org\/10.1109\/ISIT.2019.8849855","DOI":"10.1109\/ISIT.2019.8849855"},{"issue":"2","key":"6_CR8","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1080\/23799927.2022.2048206","volume":"7","author":"A Barenghi","year":"2022","unstructured":"Barenghi, A., Biasse, J.F., Ngo, T., Persichetti, E., Santini, P.: Advanced signature functionalities from the code equivalence problem. Int. J. Comput. Math. Comput. Syst. Theory 7(2), 112\u2013128 (2022)","journal-title":"Int. J. Comput. Math. Comput. Syst. Theory"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Battagliola, M., Borin, G., Meneghetti, A., Persichetti, E.: Cutting the grass: threshold group action signature schemes. Cryptology ePrint Archive (2023)","DOI":"10.1007\/978-3-031-58868-6_18"},{"key":"6_CR10","unstructured":"Belsley, E.: Rates of convergence of Markov chains related to association schemes. Harvard University, Ph.D. thesis (1993)"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-030-81652-0_15","volume-title":"Selected Areas in Cryptography","author":"W Beullens","year":"2021","unstructured":"Beullens, W.: Not enough LESS: an improved algorithm for solving code equivalence problems over $$\\mathbb{F}_q$$. In: Dunkelman, O., Jacobson, Jr., M.J., O\u2019Flynn, C. (eds.) SAC 2020. LNCS, vol. 12804, pp. 387\u2013403. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81652-0_15"},{"key":"6_CR12","doi-asserted-by":"publisher","unstructured":"Beullens, W.: Graph-theoretic algorithms for the alternating trilinear form equivalence problem. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023 - Part III. LNCS, vol. 14083, pp. 101\u2013126. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38548-3_4","DOI":"10.1007\/978-3-031-38548-3_4"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-030-51938-4_3","volume-title":"Progress in Cryptology - AFRICACRYPT 2020","author":"J-F Biasse","year":"2020","unstructured":"Biasse, J.-F., Micheli, G., Persichetti, E., Santini, P.: LESS is more: code-based signatures without syndromes. In: Nitaj, A., Youssef, A. (eds.) AFRICACRYPT 2020. LNCS, vol. 12174, pp. 45\u201365. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51938-4_3"},{"key":"6_CR14","unstructured":"Bl\u00e4ser, M., et al.: On digital signatures based on isomorphism problems: QROM security, ring signatures, and applications. Cryptology ePrint Archive, Paper 2022\/1184 (2022). https:\/\/eprint.iacr.org\/2022\/1184"},{"key":"6_CR15","unstructured":"Bl\u00e4ser, M., et al.: The ALTEQ signature scheme: algorithm specifications and supporting documentation (2023). https:\/\/pqcalteq.github.io\/ALTEQ_spec_2023.09.18.pdf"},{"key":"6_CR16","doi-asserted-by":"publisher","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system. I. The user language. J. Symbolic Comput. 24(3\u20134), 235\u2013265 (1997). https:\/\/doi.org\/10.1006\/jsco.1996.0125. Computational algebra and number theory, London (1993)","DOI":"10.1006\/jsco.1996.0125"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-642-38348-9_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"C Bouillaguet","year":"2013","unstructured":"Bouillaguet, C., Fouque, P.-A., V\u00e9ber, A.: Graph-theoretic algorithms for the \u201cIsomorphism of Polynomials\u2019\u2019 problem. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 211\u2013227. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_13"},{"key":"6_CR18","doi-asserted-by":"publisher","unstructured":"Brassard, G., Hoyer, P., Tapp, A.: Quantum cryptanalysis of hash and claw-free functions. In: Lucchesi, C.L., Moura, A.V. (eds.) LATIN 1998. LNCS, vol. 1380, pp. 163\u2013169. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054319","DOI":"10.1007\/BFb0054319"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/3-540-38424-3_7","volume-title":"Advances in Cryptology-CRYPT0\u2019 90","author":"G Brassard","year":"1991","unstructured":"Brassard, G., Yung, M.: One-way group actions. In: Menezes, A.J., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 94\u2013107. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-38424-3_7"},{"key":"6_CR20","doi-asserted-by":"publisher","unstructured":"B\u00fcrgisser, P., Franks, C., Garg, A., de\u00a0Oliveira, R.M., Walter, M., Wigderson, A.: Efficient algorithms for tensor scaling, quantum marginals, and moment polytopes. In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, 7\u20139 October 2018, pp. 883\u2013897 (2018). https:\/\/doi.org\/10.1109\/FOCS.2018.00088","DOI":"10.1109\/FOCS.2018.00088"},{"key":"6_CR21","unstructured":"Chou, T., et al.: Matrix code equivalence digital signature (2023). https:\/\/www.meds-pqc.org\/spec\/MEDS-2023-07-26.pdf"},{"key":"6_CR22","doi-asserted-by":"publisher","unstructured":"Chou, T., et al.: Take your MEDS: digital signatures from matrix code equivalence. In: El Mrabet, N., De Feo, L., Duquesne, S. (eds.) AFRICACRYPT 2023. LNCS, vol. 14064, pp. 28\u201352. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-37679-5_2","DOI":"10.1007\/978-3-031-37679-5_2"},{"key":"6_CR23","unstructured":"Couvreur, A., Debris-Alazard, T., Gaborit, P.: On the hardness of code equivalence problems in rank metric. arXiv preprint arXiv:2011.04611 (2020)"},{"key":"6_CR24","unstructured":"D\u2019Alconzo, G., Gangemi, A.: TRIFORS: LINKable trilinear forms ring signature. Cryptology ePrint Archive (2022)"},{"key":"6_CR25","doi-asserted-by":"publisher","unstructured":"Ducas, L., Postlethwaite, E.W., Pulles, L.N., Woerden, W.V.: HAWK: module LIP makes lattice signatures fast, compact and simple. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022, vol. 13794, pp. 65\u201394. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22972-5_3","DOI":"10.1007\/978-3-031-22972-5_3"},{"key":"6_CR26","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":"6_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/11761679_3","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"J-C Faug\u00e8re","year":"2006","unstructured":"Faug\u00e8re, J.-C., Perret, L.: Polynomial equivalence problems: algorithmic and theoretical aspects. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 30\u201347. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11761679_3"},{"key":"6_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 86","author":"A Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_12"},{"key":"6_CR29","doi-asserted-by":"publisher","unstructured":"Fulman, J., Goldstein, L.: Stein\u2019s method and the rank distribution of random matrices over finite fields. Ann. Probab. 43(3) (2015). https:\/\/doi.org\/10.1214\/13-aop889","DOI":"10.1214\/13-aop889"},{"issue":"3","key":"6_CR30","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1145\/116825.116852","volume":"38","author":"O Goldreich","year":"1991","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity for all languages in NP have zero-knowledge proof systems. J. ACM 38(3), 691\u2013729 (1991). https:\/\/doi.org\/10.1145\/116825.116852","journal-title":"J. ACM"},{"key":"6_CR31","doi-asserted-by":"crossref","unstructured":"Grochow, J.A., Qiao, Y.: On the complexity of isomorphism problems for tensors, groups, and polynomials I: tensor isomorphism-completeness. SIAM J. Comput. 52(2), 568\u2013617 (2023)","DOI":"10.1137\/21M1441110"},{"key":"6_CR32","doi-asserted-by":"crossref","unstructured":"Grochow, J.A., Qiao, Y., Tang, G.: Average-case algorithms for testing isomorphism of polynomials, algebras, and multilinear forms. J. Groups Complex. Cryptol. 14 (2022)","DOI":"10.46298\/jgcc.2022.14.1.9431"},{"key":"6_CR33","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pp. 212\u2013219 (1996)","DOI":"10.1145\/237814.237866"},{"key":"6_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-030-36030-6_11","volume-title":"Theory of Cryptography","author":"Z Ji","year":"2019","unstructured":"Ji, Z., Qiao, Y., Song, F., Yun, A.: General linear group action on tensors: a candidate for post-quantum cryptography. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019. LNCS, vol. 11891, pp. 251\u2013281. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36030-6_11"},{"key":"6_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-48405-1_2","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 99","author":"A Kipnis","year":"1999","unstructured":"Kipnis, A., Shamir, A.: Cryptanalysis of the HFE public key cryptosystem by relinearization. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 19\u201330. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_2"},{"issue":"3","key":"6_CR36","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1109\/TIT.1982.1056498","volume":"28","author":"J Leon","year":"1982","unstructured":"Leon, J.: Computing automorphism groups of error-correcting codes. IEEE Trans. Inf. Theory 28(3), 496\u2013511 (1982)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"6_CR37","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s00453-011-9521-6","volume":"63","author":"F Magniez","year":"2012","unstructured":"Magniez, F., Nayak, A., Richter, P.C., Santha, M.: On the hitting times of quantum versus random walks. Algorithmica 63, 91\u2013116 (2012)","journal-title":"Algorithmica"},{"key":"6_CR38","doi-asserted-by":"crossref","unstructured":"Magniez, F., Nayak, A., Roland, J., Santha, M.: Search via quantum walk. In: Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, pp. 575\u2013584 (2007)","DOI":"10.1145\/1250790.1250874"},{"key":"6_CR39","doi-asserted-by":"crossref","unstructured":"Reijnders, K., Samardjiska, S., Trimoska, M.: Hardness estimates of the code equivalence problem in the rank metric. Des. Codes Cryptogr. 92, 1\u201330 (2024)","DOI":"10.1007\/s10623-023-01338-x"},{"key":"6_CR40","doi-asserted-by":"crossref","unstructured":"Sendrier, N.: Finding the permutation between equivalent linear codes: the support splitting algorithm. IEEE Trans. Inf. Theory 46(4), 1193\u20131203 (2000)","DOI":"10.1109\/18.850662"},{"key":"6_CR41","unstructured":"Szegedy, M.: Spectra of quantized walks and a $$\\sqrt{\\delta \\epsilon }$$-rule. arXiv preprint quant-ph\/0401053 (2004)"},{"key":"6_CR42","doi-asserted-by":"publisher","unstructured":"Tang, G., Duong, D.H., Joux, A., Plantard, T., Qiao, Y., Susilo, W.: Practical post-quantum signature schemes from isomorphism problems of trilinear forms. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022 Part III. LNCS, vol. 13277, pp. 582\u2013612. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07082-2_21","DOI":"10.1007\/978-3-031-07082-2_21"},{"issue":"50","key":"6_CR43","doi-asserted-by":"publisher","first-page":"5285","DOI":"10.1016\/j.tcs.2009.08.030","volume":"410","author":"S Tani","year":"2009","unstructured":"Tani, S.: Claw finding algorithms using quantum walk. Theoret. Comput. Sci. 410(50), 5285\u20135297 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-030-25510-7_10","volume-title":"Post-Quantum Cryptography","author":"J Verbel","year":"2019","unstructured":"Verbel, J., Baena, J., Cabarcas, D., Perlner, R., Smith-Tone, D.: On the complexity of \u201cSuperdetermined\u2019\u2019 Minrank instances. In: Ding, J., Steinwandt, R. (eds.) PQCrypto 2019. LNCS, vol. 11505, pp. 167\u2013186. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25510-7_10"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-58734-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T00:05:34Z","timestamp":1777507534000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-58734-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031587337","9783031587344"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-58734-4_6","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":"1 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zurich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Switzerland","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":"26 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}