{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T04:41:04Z","timestamp":1775018464298,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":40,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819609437","type":"print"},{"value":"9789819609444","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T00:00:00Z","timestamp":1733961600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T00:00:00Z","timestamp":1733961600000},"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-0944-4_3","type":"book-chapter","created":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T05:57:20Z","timestamp":1733896640000},"page":"66-96","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Rare Structures in\u00a0Tensor Graphs"],"prefix":"10.1007","author":[{"given":"Lars","family":"Ran","sequence":"first","affiliation":[]},{"given":"Simona","family":"Samardjiska","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,12]]},"reference":[{"key":"3_CR1","unstructured":"NIST fourth round announcement. NIST Official Website (2021), https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/round-4-submissions"},{"issue":"1","key":"3_CR2","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.jco.2012.07.001","volume":"29","author":"M Bardet","year":"2013","unstructured":"Bardet, M., Faug\u00e8re, J., Salvy, B., Spaenlehauer, P.: On the complexity of solving quadratic Boolean systems. Journal of Complexity 29(1), 53\u201375 (2013)","journal-title":"Journal of Complexity"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Barenghi, A., Biasse, J., Persichetti, E., Santini, P.: LESS-FM: fine-tuning signatures from the code equivalence problem. In: Cheon, J.H., Tillich, J. (eds.) PQCrypto 2021. LNCS, vol. 12841, pp. 23\u201343. Springer (2021)","DOI":"10.1007\/978-3-030-81293-5_2"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Beullens, W.: Not enough LESS: an improved algorithm for solving code equivalence problems over $$\\mathbb{F}_q$$. In: Dunkelman, O., Jacobson, M.J., O\u2019Flynn, C. (eds.) SAC 2020. LNCS, vol. 12804, pp. 387\u2013403. Springer (2020)","DOI":"10.1007\/978-3-030-81652-0_15"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-031-38548-3_4","volume-title":"Advances in Cryptology - CRYPTO 2023","author":"W Beullens","year":"2023","unstructured":"Beullens, W.: Graph-theoretic algorithms for the alternating trilinear form equivalence problem. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology - CRYPTO 2023, pp. 101\u2013126. Springer Nature Switzerland, Cham (2023)"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Beullens, W., Katsumata, S., Pintore, F.: Calamari and Falafl: Logarithmic (linkable) ring signatures from isogenies and lattices. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12492, pp. 464\u2013492. Springer (2020)","DOI":"10.1007\/978-3-030-64834-3_16"},{"key":"3_CR7","doi-asserted-by":"crossref","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 (2020)","DOI":"10.1007\/978-3-030-51938-4_3"},{"key":"3_CR8","unstructured":"Bl\u00e4ser, M., Duong, D.H., Narayanan, A.K., Plantard, T., Qiao, Y., Sipasseuth, A., , Tang, G.: The ALTEQ Signature Scheme: Algorithm Specifications and Supporting Documentation. NIST PQC Submission (2023)"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The Magma Algebra System. I. The User Language. J. Symbolic Comput. 24(3-4), 235\u2013265 (1997)","DOI":"10.1006\/jsco.1996.0125"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Bouillaguet, C., Fouque, P., V\u00e9ber, A.: Graph-theoretic algorithms for the \u201cisomorphism of polynomials\u201d problem. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol.\u00a07881, pp. 211\u2013227. Springer (2013)","DOI":"10.1007\/978-3-642-38348-9_13"},{"key":"3_CR11","unstructured":"Buchberger, B.: Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal. Ph.D. thesis, University of Innsbruck (1965)"},{"key":"3_CR12","unstructured":"Chou, T., Niederhagen, R., Persichetti, E., Ran, L., Randrianarisoa, T.H., Reijnders, K., Samardjiska, S., Trimoska, M.: MEDS \u2013 Matrix Equivalence Digital Signature (2023), https:\/\/meds-pqc.org\/spec\/MEDS-2023-05-31.pdf, submission to the NIST Digital Signature Scheme standardization process"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-031-37679-5_2","volume-title":"Progress in Cryptology - AFRICACRYPT 2023","author":"T Chou","year":"2023","unstructured":"Chou, T., Niederhagen, R., Persichetti, E., Randrianarisoa, T.H., Reijnders, K., Samardjiska, S., Trimoska, M.: Take your meds: Digital signatures from matrix code equivalence. In: El Mrabet, N., De Feo, L., Duquesne, S. (eds.) Progress in Cryptology - AFRICACRYPT 2023, pp. 28\u201352. Springer Nature Switzerland, Cham (2023)"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Courtois, N.T., Klimov, A., Patarin, J., Shamir, A.: Efficient algorithms for solving overdefined systems of multivariate polynomial equations. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 392\u2013407. Springer (2000)","DOI":"10.1007\/3-540-45539-6_27"},{"key":"3_CR15","unstructured":"Couvreur, A., Debris-Alazard, T., Gaborit, P.: On the hardness of code equivalence problems in rank metric. arXiv (2021)"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"De\u00a0Feo, L., Galbraith, S.D.: SeaSign: Compact isogeny signatures from class group actions. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11478, pp. 759\u2013789. Springer (2019)","DOI":"10.1007\/978-3-030-17659-4_26"},{"issue":"3","key":"3_CR17","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1016\/j.laa.2010.03.040","volume":"433","author":"J Draisma","year":"2010","unstructured":"Draisma, J., Shaw, R.: Singular lines of trilinear forms. Linear algebra and its applications 433(3), 690\u2013697 (2010)","journal-title":"Linear algebra and its applications"},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0022-4049(99)00005-5","volume":"139","author":"JC Faug\u00e8re","year":"1999","unstructured":"Faug\u00e8re, J.C.: A new efficient algorithm for computing Gr\u00f6bner bases (F4). Journal of Pure and Applied Algebra 139, 61\u201388 (1999)","journal-title":"Journal of Pure and Applied Algebra"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re, J.C., Perret, L.: Polynomial equivalence problems: Algorithmic and theoretical aspects. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 30\u201347. Springer (2006)","DOI":"10.1007\/11761679_3"},{"key":"3_CR20","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity or all languages in np have zero-knowledge proof systems. J. ACM 38(3), 690-728 (jul 1991). https:\/\/doi.org\/10.1145\/116825.116852, https:\/\/doi.org\/10.1145\/116825.116852","DOI":"10.1145\/116825.116852"},{"key":"3_CR21","unstructured":"Grochow, J.A., Qiao, Y.: Isomorphism problems for tensors, groups, and cubic forms: completeness and reductions (2019)"},{"key":"3_CR22","doi-asserted-by":"publisher","unstructured":"Grochow, J.A., Qiao, Y., Tang, G.: Average-case algorithms for testing isomorphism of polynomials, algebras, and multilinear forms. Journal of Groups, Complexity, Cryptology Volume 14, Issue 1 (Aug 2022). https:\/\/doi.org\/10.46298\/jgcc.2022.14.1.9431, https:\/\/gcc.episciences.org\/9836, preliminary version appeared in STACS \u201921. https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2021.38. Preprint available at arXiv:2012.01085","DOI":"10.46298\/jgcc.2022.14.1.9431 10.4230\/LIPIcs.STACS.2021.38"},{"key":"3_CR23","unstructured":"Hulsing, A., Bernstein, D.J., Dobraunig, C., Eichlseder, M., Fluhrer, S., Gazdag, S.L., Kampanakis, P., Kolbl, S., Lange, T., Lauridsen, M.M., Mendel, F., Niederhagen, R., Rechberger, C., Rijneveld, J., Schwabe, P., Aumasson, J.P., Westerbaan, B., Beullens, W.: SPHINCS+. NIST PQC Submission (2020)"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"H\u00fclsing, A., Butin, D., Gazdag, S.L., Rijneveld, J., Mohaisen, A.: XMSS: extended hash-based signatures. RFC 8391 (2018)","DOI":"10.17487\/RFC8391"},{"key":"3_CR25","unstructured":"ISO (International Organization for Standardization): Information security, cybersecurity and privacy protection: Iso\/iec wd 14888-4 information technology - security techniques - digital signatures with appendix - part 4: Stateful hash-based mechanisms, https:\/\/www.iso.org\/standard\/80492.html"},{"key":"3_CR26","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-76620-1_1","volume-title":"Number-Theoretic Methods in Cryptology","author":"A Joux","year":"2018","unstructured":"Joux, A., Vitse, V.: A Crossbred Algorithm for Solving Boolean Polynomial Systems. In: Kaczorowski, J., Pieprzyk, J., Pomyka\u0142a, J. (eds.) Number-Theoretic Methods in Cryptology, pp. 3\u201321. Springer International Publishing, Cham (2018)"},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"Lazard, D.: Gr\u00f6bner-Bases, Gaussian elimination and resolution of systems of algebraic equations. In: van Hulzen, J.A. (ed.) EUROCAL. Lecture Notes in Computer Science, vol.\u00a0162, pp. 146\u2013156. Springer (1983)","DOI":"10.1007\/3-540-12868-9_99"},{"issue":"3","key":"3_CR28","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1109\/TIT.1982.1056498","volume":"28","author":"JS Leon","year":"1982","unstructured":"Leon, J.S.: Computing automorphism groups of error-correcting codes. IEEE Trans. Inf. Theory 28(3), 496\u2013510 (1982)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3_CR29","unstructured":"Lyubashevsky, V., Ducas, L., Kiltz, E., Lepoint, T., Schwabe, P., Seiler, G., Stehl\u00e9, D., Bai, S.: CRYSTALS-DILITHIUM. NIST PQC Submission (2020)"},{"key":"3_CR30","doi-asserted-by":"crossref","unstructured":"Narayanan, A.K., Qiao, Y., Tang, G.: Algorithms for matrix code and alternating trilinear form equivalences via new isomorphism invariants. Springer-Verlag (2024)","DOI":"10.1007\/978-3-031-58734-4_6"},{"key":"3_CR31","unstructured":"NIST (National Institute for Standards and Technology): Post-Quantum Cryptography Standardization (2017). https:\/\/csrc.nist.gov\/Projects\/Post-Quantum-Cryptography"},{"key":"3_CR32","unstructured":"NIST (National Institute for Standards and Technology): Fifth PQC Standardization Conference (2024). https:\/\/csrc.nist.gov\/Events\/2024\/fifth-pqc-standardization-conference"},{"key":"3_CR33","doi-asserted-by":"crossref","unstructured":"Patarin, J.: Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): two new families of asymmetric algorithms. In: EUROCRYPT \u201996. LNCS, vol.\u00a01070, pp. 33\u201348. Springer (1996)","DOI":"10.1007\/3-540-68339-9_4"},{"key":"3_CR34","unstructured":"Perret, L.: On the computational complexity of some equivalence problems of polynomial systems of equations over finite fields. Electronic Colloquium on Computational Complexity (ECCC) (116) (2004)"},{"key":"3_CR35","doi-asserted-by":"crossref","unstructured":"Perret, L.: A Fast Cryptanalysis of the Isomorphism of Polynomials with One Secret Problem. In: EUROCRYPT. Lecture Notes in Computer Science, vol.\u00a03494, pp. 354\u2013370. Springer (2005)","DOI":"10.1007\/11426639_21"},{"key":"3_CR36","unstructured":"Prest, T., Fouque, P.A., Hoffstein, J., Kirchner, P., Lyubashevsky, V., Pornin, T., Ricosset, T., Seiler, G., Whyte, W., Zhang, Z.: FALCON. NIST PQC Submission (2020)"},{"key":"3_CR37","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-031-46495-9_5","volume-title":"Code-Based Cryptography","author":"L Ran","year":"2023","unstructured":"Ran, L., Samardjiska, S., Trimoska, M.: Algebraic algorithm for the alternating trilinear form equivalence problem. In: Esser, A., Santini, P. (eds.) Code-Based Cryptography, pp. 84\u2013103. Springer Nature Switzerland, Cham (2023)"},{"key":"3_CR38","doi-asserted-by":"publisher","unstructured":"Reijnders, K., Samardjiska, S., Trimoska, M.: Hardness estimates of the code equivalence problem in the rank metric. Designs, Codes and Cryptography 92, 1\u201330 (01 2024). https:\/\/doi.org\/10.1007\/s10623-023-01338-x","DOI":"10.1007\/s10623-023-01338-x"},{"key":"3_CR39","unstructured":"Schwabe, P., Avanzi, R., Bos, J., Ducas, L., Kiltz, E., Lepoint, T., Lyubashevsky, V., Schanck, J.M., Seiler, G., Stehl\u00e9, D.: CRYSTALS-KYBER. NIST PQC Submission (2020)"},{"key":"3_CR40","doi-asserted-by":"crossref","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: EUROCRYPT 2022. LNCS, vol. 13277, pp. 582\u2013612. Springer (2022)","DOI":"10.1007\/978-3-031-07082-2_21"}],"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-0944-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T06:11:26Z","timestamp":1733897486000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0944-4_3"}},"subtitle":["Bermuda Triangles for Cryptosystems Based on the Tensor Isomorphism Problem"],"short-title":[],"issued":{"date-parts":[[2024,12,12]]},"ISBN":["9789819609437","9789819609444"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0944-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,12]]},"assertion":[{"value":"12 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"}}]}}