{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T00:25:19Z","timestamp":1776126319509,"version":"3.50.1"},"publisher-location":"Cham","reference-count":85,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030360290","type":"print"},{"value":"9783030360306","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-36030-6_11","type":"book-chapter","created":{"date-parts":[[2019,11,22]],"date-time":"2019-11-22T17:02:36Z","timestamp":1574442156000},"page":"251-281","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":28,"title":["General Linear Group Action on Tensors: A Candidate for Post-quantum Cryptography"],"prefix":"10.1007","author":[{"given":"Zhengfeng","family":"Ji","sequence":"first","affiliation":[]},{"given":"Youming","family":"Qiao","sequence":"additional","affiliation":[]},{"given":"Fang","family":"Song","sequence":"additional","affiliation":[]},{"given":"Aaram","family":"Yun","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,22]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Allen-Zhu, Z., Garg, A., Li, Y., de Oliveira, R.M., Wigderson, A.: Operator scaling via geodesically convex optimization, invariant theory and polynomial identity testing. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, 25\u201329 June 2018, pp. 172\u2013181 (2018)","DOI":"10.1145\/3188745.3188942"},{"issue":"3","key":"11_CR2","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/BF01388470","volume":"76","author":"M Aschbacher","year":"1984","unstructured":"Aschbacher, M.: On the maximal subgroups of the finite classical groups. Inven. Math. 76(3), 469\u2013514 (1984)","journal-title":"Inven. Math."},{"key":"11_CR3","unstructured":"Babai, L.: Monte-Carlo algorithms in graph isomorphism testing. Technical report 79\u201310, D\u00e9p. Math. et Stat., Universit\u00e9 de Montr\u00e9al (1979)"},{"key":"11_CR4","unstructured":"Babai, L.: Local expansion of vertex-transitive graphs and random generation in finite groups. In: Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, New Orleans, Louisiana, USA, 5\u20138 May 1991, pp. 164\u2013174 (1991)"},{"key":"11_CR5","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)"},{"key":"11_CR6","doi-asserted-by":"publisher","unstructured":"Babai, L., Beals, R., Seress, \u00c1.: Polynomial-time theory of matrix groups. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 \u2013 June 2, 2009, pp. 55\u201364 (2009). https:\/\/doi.org\/10.1145\/1536414.1536425","DOI":"10.1145\/1536414.1536425"},{"issue":"3","key":"11_CR7","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1137\/0209047","volume":"9","author":"L Babai","year":"1980","unstructured":"Babai, L., Erd\u00f6s, P., Selkow, S.M.: Random graph isomorphism. SIAM J. Comput. 9(3), 628\u2013635 (1980)","journal-title":"SIAM J. Comput."},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Babai, L., Szemer\u00e9di, E.: On the complexity of matrix group problems I. In: 25th Annual Symposium on Foundations of Computer Science, West Palm Beach, Florida, USA, 24\u201326 October 1984, pp. 229\u2013240 (1984)","DOI":"10.1109\/SFCS.1984.715919"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Bartusek, J., Ma, F., Zhandry, M.: The distinction between fixed and random generators in group-based assumptions. IACR Cryptology ePrint Archive 2019, 202 (2019). https:\/\/eprint.iacr.org\/2019\/202","DOI":"10.1007\/978-3-030-26951-7_27"},{"key":"11_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88702-7","volume-title":"Post-Quantum Cryptography","author":"DJ Bernstein","year":"2009","unstructured":"Bernstein, D.J., Buchmann, J., Dahmen, E.: Post-Quantum Cryptography. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-540-88702-7"},{"issue":"4","key":"11_CR11","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1016\/j.jco.2015.04.001","volume":"31","author":"J Berthomieu","year":"2015","unstructured":"Berthomieu, J., Faug\u00e8re, J., Perret, L.: Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case. J. Complexity 31(4), 590\u2013616 (2015)","journal-title":"J. Complexity"},{"key":"11_CR12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511542756","volume-title":"Enumeration of Finite Groups","author":"SR Blackburn","year":"2007","unstructured":"Blackburn, S.R., Neumann, P.M., Venkataraman, G.: Enumeration of Finite Groups. Cambridge University Press, Cambridge (2007)"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/BFb0054851","volume-title":"Algorithmic Number Theory","author":"D Boneh","year":"1998","unstructured":"Boneh, D.: The Decision Diffie-Hellman problem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 48\u201363. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054851"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/978-3-642-19379-8_29","volume-title":"Public Key Cryptography \u2013 PKC 2011","author":"C Bouillaguet","year":"2011","unstructured":"Bouillaguet, C., Faug\u00e8re, J.-C., Fouque, P.-A., Perret, L.: Practical cryptanalysis of the identification scheme based on the isomorphism of polynomial with one secret problem. In: Catalano, D., Fazio, N., Gennaro, R., Nicolosi, A. (eds.) PKC 2011. LNCS, vol. 6571, pp. 473\u2013493. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19379-8_29"},{"key":"11_CR15","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\u201d 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":"11_CR16","doi-asserted-by":"crossref","unstructured":"Brassard, G., Cr\u00e9peau, C.: Non-transitive transfer of confidence: a perfect zero-knowledge interactive protocol for SAT and beyond. In: 27th Annual Symposium on Foundations of Computer Science, FOCS 1986, Toronto, Canada, October 1986, pp. 188\u2013195 (1986)","DOI":"10.1109\/SFCS.1986.33"},{"key":"11_CR17","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"},{"issue":"11","key":"11_CR18","doi-asserted-by":"publisher","first-page":"4020","DOI":"10.1016\/j.jalgebra.2008.07.014","volume":"320","author":"PA Brooksbank","year":"2008","unstructured":"Brooksbank, P.A., Luks, E.M.: Testing isomorphism of modules. J. Algebr. 320(11), 4020\u20134029 (2008). https:\/\/doi.org\/10.1016\/j.jalgebra.2008.07.014","journal-title":"J. Algebr."},{"key":"11_CR19","doi-asserted-by":"publisher","unstructured":"B\u00fcrgisser, P., Franks, C., Garg, A., de Oliveira, 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":"11_CR20","unstructured":"B\u00fcrgisser, P., Garg, A., de Oliveira, R.M., Walter, M., Wigderson, A.: Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory. In: 9th Innovations in Theoretical Computer Science Conference, ITCS 2018, Cambridge, MA, USA, 11\u201314 January 2018, pp. 24:1\u201324:20 (2018)"},{"issue":"3","key":"11_CR21","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1006\/jcss.1998.1608","volume":"58","author":"JF Buss","year":"1999","unstructured":"Buss, J.F., Frandsen, G.S., Shallit, J.O.: The computational complexity of some problems of linear algebra. J. Comput. Syst. Sci. 58(3), 572\u2013596 (1999)","journal-title":"J. Comput. Syst. Sci."},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Chen, L.: Report on post-quantum cryptography. NIST.GOV (2016)","DOI":"10.6028\/NIST.IR.8105"},{"issue":"1","key":"11_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1515\/jmc-2012-0016","volume":"8","author":"A Childs","year":"2014","unstructured":"Childs, A., Jao, D., Soukharev, V.: Constructing elliptic curve isogenies in quantum subexponential time. J. Math. Cryptol. 8(1), 1\u201329 (2014)","journal-title":"J. Math. Cryptol."},{"key":"11_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1103\/RevModPhys.82.1","volume":"82","author":"AM Childs","year":"2010","unstructured":"Childs, A.M., van Dam, W.: Quantum algorithms for algebraic problems. Rev. Mod. Phys. 82, 1\u201352 (2010). https:\/\/doi.org\/10.1103\/RevModPhys.82.1","journal-title":"Rev. Mod. Phys."},{"key":"11_CR25","doi-asserted-by":"crossref","unstructured":"Chistov, A., Ivanyos, G., Karpinski, M.: Polynomial time algorithms for modules over finite dimensional algebras. In: Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, pp. 68\u201374. ACM (1997)","DOI":"10.1145\/258726.258751"},{"key":"11_CR26","unstructured":"Couveignes, J.M.: Hard homogeneous spaces. IACR Cryptology ePrint Archive (2006). http:\/\/eprint.iacr.org\/2006\/291"},{"key":"11_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BFb0055717","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201998","author":"R Cramer","year":"1998","unstructured":"Cramer, R., Shoup, V.: A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 13\u201325. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055717"},{"issue":"3","key":"11_CR28","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1515\/jmc-2012-0015","volume":"8","author":"L De Feo","year":"2014","unstructured":"De Feo, L., Jao, D., Pl\u00fbt, J.: Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies. J. Math. Cryptol. 8(3), 209\u2013247 (2014)","journal-title":"J. Math. Cryptol."},{"key":"11_CR29","unstructured":"Derksen, H., Makam, V.: Algorithms for orbit closure separation for invariants and semi-invariants of matrices. CoRR abs\/1801.02043 (2018). http:\/\/arxiv.org\/abs\/1801.02043"},{"key":"11_CR30","doi-asserted-by":"crossref","unstructured":"Derksen, H., Makam, V.: An exponential lower bound for the degrees of invariants of cubic forms and tensor actions (2019)","DOI":"10.1016\/j.aim.2020.107136"},{"issue":"3","key":"11_CR31","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1090\/S0894-0347-00-00331-3","volume":"13","author":"H Derksen","year":"2000","unstructured":"Derksen, H., Weyman, J.: Semi-invariants of quivers and saturation for Littlewood-Richardson coefficients. J. Am. Math. Soc. 13(3), 467\u2013479 (2000)","journal-title":"J. Am. Math. Soc."},{"issue":"6","key":"11_CR32","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6), 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"11_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1007\/978-3-642-22792-9_43","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"H Dinh","year":"2011","unstructured":"Dinh, H., Moore, C., Russell, A.: McEliece and Niederreiter cryptosystems that resist quantum Fourier sampling attacks. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 761\u2013779. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_43"},{"issue":"3&4","key":"11_CR34","first-page":"260","volume":"15","author":"HT Dinh","year":"2015","unstructured":"Dinh, H.T., Moore, C., Russell, A.: Limitations of single coset states and quantum algorithms for code equivalence. Quantum Inf. Comput. 15(3&4), 260\u2013294 (2015)","journal-title":"Quantum Inf. Comput."},{"key":"11_CR35","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":"11_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1007\/978-3-030-17659-4_26","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"L De Feo","year":"2019","unstructured":"De Feo, 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, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_26"},{"key":"11_CR37","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":"11_CR38","doi-asserted-by":"crossref","unstructured":"Friedl, K., R\u00f3nyai, L.: Polynomial time solutions of some problems of computational algebra. In: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, pp. 153\u2013162. ACM (1985)","DOI":"10.1145\/22145.22162"},{"key":"11_CR39","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1016\/j.laa.2018.12.022","volume":"566","author":"V Futorny","year":"2019","unstructured":"Futorny, V., Grochow, J.A., Sergeichuk, V.V.: Wildness for tensors. Linear Algebr. Appl. 566, 212\u2013244 (2019). https:\/\/doi.org\/10.1016\/j.laa.2018.12.022","journal-title":"Linear Algebr. Appl."},{"issue":"10","key":"11_CR40","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s11128-018-2023-6","volume":"17","author":"SD Galbraith","year":"2018","unstructured":"Galbraith, S.D., Vercauteren, F.: Computational problems in supersingular elliptic curve isogenies. Quantum Inf. Process. 17(10), 265 (2018)","journal-title":"Quantum Inf. Process."},{"issue":"1","key":"11_CR41","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10207-003-0025-5","volume":"2","author":"W Geiselmann","year":"2003","unstructured":"Geiselmann, W., Meier, W., Steinwandt, R.: An attack on the isomorphisms of polynomials problem with one secret. Int. J. Inf. Sec. 2(1), 59\u201364 (2003)","journal-title":"Int. J. Inf. Sec."},{"issue":"3","key":"11_CR42","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 or 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":"11_CR43","doi-asserted-by":"publisher","unstructured":"Grochow, J.A.: Matrix isomorphism of matrix Lie algebras. In: Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, 26\u201329 June 2012, pp. 203\u2013213 (2012). https:\/\/doi.org\/10.1109\/CCC.2012.34","DOI":"10.1109\/CCC.2012.34"},{"key":"11_CR44","unstructured":"Grochow, J.A., Qiao, Y.: Isomorphism problems for tensors, groups, and cubic forms: completeness and reductions (2019). arXiv:1907.00309 [cs.CC]"},{"issue":"6","key":"11_CR45","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1857914.1857918","volume":"57","author":"Sean Hallgren","year":"2010","unstructured":"Hallgren, S., Moore, C., R\u00f6tteler, M., Russell, A., Sen, P.: Limitations of quantum coset states for graph isomorphism. J. ACM 57(6), 34:1\u201334:33 (2010). https:\/\/doi.org\/10.1145\/1857914.1857918","journal-title":"Journal of the ACM"},{"key":"11_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-540-74456-6_31","volume-title":"Mathematical Foundations of Computer Science 2007","author":"RJ Hartung","year":"2007","unstructured":"Hartung, R.J., Schnorr, C.-P.: Public key identification based on the equivalence of quadratic forms. In: Ku\u010dera, L., Ku\u010dera, A. (eds.) MFCS 2007. LNCS, vol. 4708, pp. 333\u2013345. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74456-6_31"},{"issue":"4","key":"11_CR47","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1016\/0196-6774(90)90014-6","volume":"11","author":"J H\u00e5stad","year":"1990","unstructured":"H\u00e5stad, J.: Tensor rank is NP-complete. J. Algorithms 11(4), 644\u2013654 (1990). https:\/\/doi.org\/10.1016\/0196-6774(90)90014-6","journal-title":"J. Algorithms"},{"key":"11_CR48","unstructured":"Haviv, I., Regev, O.: On the lattice isomorphism problem. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, 5\u20137 January 2014, pp. 391\u2013404 (2014)"},{"issue":"6","key":"11_CR49","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2512329","volume":"60","author":"Christopher J. Hillar","year":"2013","unstructured":"Hillar, C.J., Lim, L.: Most tensor problems are NP-hard. J. ACM 60(6), 45:1\u201345:39 (2013). https:\/\/doi.org\/10.1145\/2512329","journal-title":"Journal of the ACM"},{"issue":"3","key":"11_CR50","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1137\/18M1165682","volume":"48","author":"G Ivanyos","year":"2019","unstructured":"Ivanyos, G., Qiao, Y.: Algorithms based on *-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing. SIAM J. Comput. 48(3), 926\u2013963 (2019). https:\/\/doi.org\/10.1137\/18M1165682","journal-title":"SIAM J. Comput."},{"issue":"8","key":"11_CR51","doi-asserted-by":"publisher","first-page":"3736","DOI":"10.1137\/090781231","volume":"39","author":"G Ivanyos","year":"2010","unstructured":"Ivanyos, G., Karpinski, M., Saxena, N.: Deterministic polynomial time algorithms for matrix completion problems. SIAM J. Comput. 39(8), 3736\u20133751 (2010). https:\/\/doi.org\/10.1137\/090781231","journal-title":"SIAM J. Comput."},{"key":"11_CR52","unstructured":"Ivanyos, G., Qiao, Y., Subrahmanyam, K.V.: Constructive non-commutative rank computation is in deterministic polynomial time. In: 8th Innovations in Theoretical Computer Science Conference, ITCS 2017, Berkeley, CA, USA, 9\u201311 January 2017, pp. 55:1\u201355:19 (2017)"},{"key":"11_CR53","unstructured":"Ji, Z., Qiao, Y., Song, F., Yun, A.: General linear group action on tensors: a candidate for post-quantum cryptography. Cryptology ePrint Archive, Report 2019\/687 (2019). https:\/\/eprint.iacr.org\/2019\/687"},{"key":"11_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-662-53008-5_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"M Kaplan","year":"2016","unstructured":"Kaplan, M., Leurent, G., Leverrier, A., \u00a0Naya-Plasencia, M.: Breaking symmetric cryptosystems using\u00a0quantum\u00a0period finding. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9815, pp. 207\u2013237. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_8"},{"key":"11_CR55","doi-asserted-by":"crossref","unstructured":"Kayal, N.: Efficient algorithms for some special cases of the polynomial equivalence problem. In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, 23\u201325 January 2011, pp. 1409\u20131421 (2011)","DOI":"10.1137\/1.9781611973082.108"},{"issue":"4","key":"11_CR56","doi-asserted-by":"publisher","first-page":"819","DOI":"10.2307\/2372655","volume":"76","author":"S Lang","year":"1954","unstructured":"Lang, S., Weil, A.: Number of points of varieties in finite fields. Am. J. Math. 76(4), 819\u2013827 (1954)","journal-title":"Am. J. Math."},{"issue":"3","key":"11_CR57","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"},{"issue":"1","key":"11_CR58","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1515\/gcc-2012-0008","volume":"4","author":"ML Lewis","year":"2012","unstructured":"Lewis, M.L., Wilson, J.B.: Isomorphism in expanding families of indistinguishable groups. Groups Complex. Cryptol. 4(1), 73\u2013110 (2012)","journal-title":"Groups Complex. Cryptol."},{"key":"11_CR59","doi-asserted-by":"crossref","unstructured":"Li, Y., Qiao, Y.: Linear algebraic analogues of the graph isomorphism problem and the Erd\u0151s-R\u00e9nyi model. In: 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, 15\u201317 October 2017, pp. 463\u2013474 (2017)","DOI":"10.1109\/FOCS.2017.49"},{"issue":"1","key":"11_CR60","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/0022-0000(82)90009-5","volume":"25","author":"EM Luks","year":"1982","unstructured":"Luks, E.M.: Isomorphism of graphs of bounded valence can be tested in polynomial time. J. Comput. Syst. Sci. 25(1), 42\u201365 (1982). https:\/\/doi.org\/10.1016\/0022-0000(82)90009-5","journal-title":"J. Comput. Syst. Sci."},{"key":"11_CR61","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-642-42033-7_7","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"G Macario-Rat","year":"2013","unstructured":"Macario-Rat, G., Plut, J., Gilbert, H.: New insight into the isomorphism of polynomial problem IP1S and its use in cryptography. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013. LNCS, vol. 8269, pp. 117\u2013133. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-42033-7_7"},{"key":"11_CR62","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-540-89255-7_11","volume-title":"Advances in Cryptology - ASIACRYPT 2008","author":"U Maurer","year":"2008","unstructured":"Maurer, U., Tessaro, S.: Basing PRFs on constant-query weak PRFs: minimizing assumptions for efficient symmetric cryptography. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol. 5350, pp. 161\u2013178. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89255-7_11"},{"key":"11_CR63","unstructured":"McKay, B.D.: Practical graph isomorphism. Congr. Numer, pp. 45\u201387 (1980)"},{"key":"11_CR64","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.jsc.2013.09.003","volume":"60","author":"BD McKay","year":"2014","unstructured":"McKay, B.D., Piperno, A.: Practical graph isomorphism. II. J. Symb. Comput. 60, 94\u2013112 (2014)","journal-title":"II. J. Symb. Comput."},{"key":"11_CR65","unstructured":"Moore, C., Russell, A., Vazirani, U.: A classical one-way function to confound quantum adversaries. arXiv preprint quant-ph\/0701115 (2007)"},{"issue":"1","key":"11_CR66","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1090\/jams\/864","volume":"30","author":"KD Mulmuley","year":"2017","unstructured":"Mulmuley, K.D.: Geometric complexity theory V: efficient algorithms for Noether normalization. J. Am. Math. Soc. 30(1), 225\u2013309 (2017)","journal-title":"J. Am. Math. Soc."},{"key":"11_CR67","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-57916-5","volume-title":"Geometric Invariant Theory","author":"D Mumford","year":"1994","unstructured":"Mumford, D., Fogarty, J., Kirwan, F.: Geometric Invariant Theory. Springer, Heidelberg (1994)"},{"issue":"2","key":"11_CR68","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1145\/972639.972643","volume":"51","author":"M Naor","year":"2004","unstructured":"Naor, M., Reingold, O.: Number-theoretic constructions of efficient pseudo-random functions. J. ACM 51(2), 231\u2013262 (2004). https:\/\/doi.org\/10.1145\/972639.972643","journal-title":"J. ACM"},{"issue":"2","key":"11_CR69","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1006\/jsco.1994.1007","volume":"17","author":"EA O\u2019Brien","year":"1994","unstructured":"O\u2019Brien, E.A.: Isomorphism testing for $$p$$-groups. J. Symb. Comput. 17(2), 133\u2013147 (1994)","journal-title":"J. Symb. Comput."},{"key":"11_CR70","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/3-540-68339-9_4","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201996","author":"J Patarin","year":"1996","unstructured":"Patarin, J.: Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): two new families of asymmetric algorithms. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 33\u201348. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68339-9_4"},{"key":"11_CR71","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/BFb0054126","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201998","author":"J Patarin","year":"1998","unstructured":"Patarin, J., Goubin, L., Courtois, N.: Improved algorithms for isomorphisms of polynomials. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 184\u2013200. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054126"},{"key":"11_CR72","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/11426639_21","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"L Perret","year":"2005","unstructured":"Perret, L.: A fast cryptanalysis of the isomorphism of polynomials with one secret problem. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 354\u2013370. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11426639_21"},{"issue":"5","key":"11_CR73","doi-asserted-by":"publisher","first-page":"1602","DOI":"10.1109\/18.623157","volume":"43","author":"E Petrank","year":"1997","unstructured":"Petrank, E., Roth, R.M.: Is code equivalence easy to decide? IEEE Trans. Inf. Theory 43(5), 1602\u20131604 (1997)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"11_CR74","unstructured":"Pl\u00fbt, J., Fouque, P., Macario-Rat, G.: Solving the \u201cisomorphism of polynomials with two secrets\u201d problem for all pairs of quadratic forms. CoRR abs\/1406.3163 (2014). http:\/\/arxiv.org\/abs\/1406.3163"},{"issue":"3","key":"11_CR75","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1137\/S0097539703440678","volume":"33","author":"O Regev","year":"2004","unstructured":"Regev, O.: Quantum computation and lattice problems. SIAM J. Comput. 33(3), 738\u2013760 (2004). https:\/\/doi.org\/10.1137\/S0097539703440678","journal-title":"SIAM J. Comput."},{"key":"11_CR76","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0027763000017633","volume":"65","author":"M Sato","year":"1977","unstructured":"Sato, M., Kimura, T.: A classification of irreducible prehomogeneous vector spaces and their relative invariants. Nagoya Math. J. 65, 1\u2013155 (1977)","journal-title":"Nagoya Math. J."},{"issue":"4","key":"11_CR77","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1109\/18.850662","volume":"46","author":"N Sendrier","year":"2000","unstructured":"Sendrier, N.: Finding the permutation between equivalent linear codes: the support splitting algorithm. IEEE Trans. Inf. Theory 46(4), 1193\u20131203 (2000)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"11_CR78","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-642-38616-9_14","volume-title":"Post-Quantum Cryptography","author":"N Sendrier","year":"2013","unstructured":"Sendrier, N., Simos, D.E.: The hardness of code equivalence over $$\\mathbb{F}_q$$ and its application to code-based cryptography. In: Gaborit, P. (ed.) PQCrypto 2013. LNCS, vol. 7932, pp. 203\u2013216. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38616-9_14"},{"key":"11_CR79","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20\u201322 November 1994, pp. 124\u2013134 (1994)"},{"key":"11_CR80","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/BFb0103126","volume-title":"Topics in Algebra","author":"CC Sims","year":"1978","unstructured":"Sims, C.C.: Some group-theoretic algorithms. In: Newman, M.F., Richardson, J.S. (eds.) Topics in Algebra. LNM, vol. 697, pp. 108\u2013124. Springer, Heidelberg (1978). https:\/\/doi.org\/10.1007\/BFb0103126"},{"key":"11_CR81","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-319-63715-0_10","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"F Song","year":"2017","unstructured":"Song, F., Yun, A.: Quantum security of NMAC and related constructions. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10402, pp. 283\u2013309. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_10"},{"key":"11_CR82","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-319-70694-8_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"D Unruh","year":"2017","unstructured":"Unruh, D.: Post-quantum security of Fiat-Shamir. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10624, pp. 65\u201395. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_3"},{"issue":"9","key":"11_CR83","first-page":"12","volume":"2","author":"B Weisfeiler","year":"1968","unstructured":"Weisfeiler, B., Lehman, A.A.: A reduction of a graph to a canonical form and an algebra arising during this reduction. Nauchno-Technicheskaya Informatsia 2(9), 12\u201316 (1968)","journal-title":"Nauchno-Technicheskaya Informatsia"},{"issue":"8","key":"11_CR84","doi-asserted-by":"publisher","first-page":"2642","DOI":"10.1016\/j.jalgebra.2009.07.029","volume":"322","author":"JB Wilson","year":"2009","unstructured":"Wilson, J.B.: Decomposing $$p$$-groups via Jordan algebras. J. Algebr. 322(8), 2642\u20132679 (2009)","journal-title":"J. Algebr."},{"key":"11_CR85","doi-asserted-by":"crossref","unstructured":"Zhandry, M.: How to construct quantum random functions. In: 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, pp. 679\u2013687. IEEE (2012)","DOI":"10.1109\/FOCS.2012.37"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-36030-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,22]],"date-time":"2022-11-22T03:08:44Z","timestamp":1669086524000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-36030-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030360290","9783030360306"],"references-count":85,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-36030-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"22 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nuremberg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Review software by Shai Halevi","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"147","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.35","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}