Document Open Access Logo

Average-Case Algorithms for Testing Isomorphism of Polynomials, Algebras, and Multilinear Forms

Authors Joshua A. Grochow , Youming Qiao , Gang Tang

PDF
Thumbnail PDF

File

LIPIcs.STACS.2021.38.pdf
  • Filesize: 0.8 MB
  • 17 pages

Document Identifiers

Author Details

Joshua A. Grochow
  • Departments of Computer Science and Mathematics, University of Colorado Boulder, Boulder, CO, USA
Youming Qiao
  • Center for Quantum Software and Information, University of Technology Sydney, Ultimo, NSW 2007, Australia
Gang Tang
  • Center for Quantum Software and Information, University of Technology Sydney, Ultimo, NSW 2007, Australia

Funding

  • Grochow, Joshua A.: Partially supported by NSF grants DMS-1750319 and DMS-1622390.
  • Qiao, Youming: Partially supported by the Australian Research Council DP200100950.
  • Tang, Gang: Partially supported by the Australian Research Council DP160101652.

Acknowledgements

We thank the anonymous reviewers for their careful reading and helpful suggestions.

Cite AsGet BibTex

Joshua A. Grochow, Youming Qiao, and Gang Tang. Average-Case Algorithms for Testing Isomorphism of Polynomials, Algebras, and Multilinear Forms. In 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 187, pp. 38:1-38:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
https://doi.org/10.4230/LIPIcs.STACS.2021.38

Abstract

We study the problems of testing isomorphism of polynomials, algebras, and multilinear forms. Our first main results are average-case algorithms for these problems. For example, we develop an algorithm that takes two cubic forms f, g ∈ 𝔽_q[x_1, … , x_n], and decides whether f and g are isomorphic in time q^O(n) for most f. This average-case setting has direct practical implications, having been studied in multivariate cryptography since the 1990s. Our second result concerns the complexity of testing equivalence of alternating trilinear forms. This problem is of interest in both mathematics and cryptography. We show that this problem is polynomial-time equivalent to testing equivalence of symmetric trilinear forms, by showing that they are both Tensor Isomorphism-complete (Grochow & Qiao, ITCS 2021), therefore is equivalent to testing isomorphism of cubic forms over most fields.

Subject Classification

ACM Subject Classification
  • Computing methodologies → Algebraic algorithms
  • Computing methodologies → Combinatorial algorithms
Keywords
  • polynomial isomorphism
  • trilinear form equivalence
  • algebra isomorphism
  • average-case algorithms
  • tensor isomorphism complete
  • symmetric and alternating bilinear maps

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Manindra Agrawal and Nitin Saxena. Automorphisms of finite rings and applications to complexity of problems. In STACS 2005, 22nd Annual Symposium on Theoretical Aspects of Computer Science, Proceedings, pages 1-17, 2005. URL: https://doi.org/10.1007/978-3-540-31856-9_1.
  2. Manindra Agrawal and Nitin Saxena. Equivalence of 𝔽-algebras and cubic forms. In STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Proceedings, pages 115-126, 2006. URL: https://doi.org/10.1007/11672142_8.
  3. Jérémy Berthomieu, Jean-Charles Faugère, and Ludovic Perret. Polynomial-time algorithms for quadratic isomorphism of polynomials: The regular case. J. Complexity, 31(4):590-616, 2015. URL: https://doi.org/10.1016/j.jco.2015.04.001.
  4. Charles Bouillaguet. Etudes d’hypothèses algorithmiques et attaques de primitives cryptographiques. PhD thesis, PhD thesis, Université Paris-Diderot-École Normale Supérieure, 2011. Google Scholar
  5. Charles Bouillaguet, Jean-Charles Faugère, Pierre-Alain Fouque, and Ludovic Perret. Practical cryptanalysis of the identification scheme based on the isomorphism of polynomial with one secret problem. In International Workshop on Public Key Cryptography, pages 473-493. Springer, 2011. URL: https://doi.org/10.1007/978-3-642-19379-8_29.
  6. Peter A. Brooksbank, Yinan Li, Youming Qiao, and James B. Wilson. Improved algorithms for alternating matrix space isometry: From theory to practice. In Fabrizio Grandoni, Grzegorz Herman, and Peter Sanders, editors, 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference), volume 173 of LIPIcs, pages 26:1-26:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. URL: https://doi.org/10.4230/LIPIcs.ESA.2020.26.
  7. Peter A. Brooksbank and James B. Wilson. Computing isometry groups of Hermitian maps. Trans. Amer. Math. Soc., 364:1975-1996, 2012. URL: https://doi.org/10.1090/S0002-9947-2011-05388-2.
  8. Vyacheslav Futorny, Joshua A. Grochow, and Vladimir V. Sergeichuk. Wildness for tensors. Lin. Alg. Appl., 566:212-244, 2019. URL: https://doi.org/10.1016/j.laa.2018.12.022.
  9. Oded Goldreich, Silvio Micali, and Avi Wigderson. Proofs that yield nothing but their validity for all languages in NP have zero-knowledge proof systems. J. ACM, 38(3):691-729, 1991. URL: https://doi.org/10.1145/116825.116852.
  10. Joshua A. Grochow and Youming Qiao. Algorithms for group isomorphism via group extensions and cohomology. SIAM J. Comput., 46(4):1153-1216, 2017. Preliminary version in IEEE Conference on Computational Complexity (CCC) 2014 (DOI:10.1109/CCC.2014.19). Also available as https://arxiv.org/abs/1309.1776 [cs.DS] and ECCC Technical Report TR13-123. URL: https://doi.org/10.1137/15M1009767.
  11. Joshua A. Grochow and Youming Qiao. On the complexity of isomorphism problems for tensors, groups, and polynomials I: Tensor Isomorphism-completeness. In ITCS, Leibniz International Proceedings in Informatics (LIPIcs), pages 31:1-31:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. URL: https://doi.org/10.4230/LIPIcs.ITCS.2021.31.
  12. Gábor Ivanyos and Youming Qiao. 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-963, 2019. URL: https://doi.org/10.1137/18M1165682.
  13. Neeraj Kayal. 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, January 23-25, 2011, pages 1409-1421, 2011. URL: https://doi.org/10.1137/1.9781611973082.108.
  14. Serge Lang. Algebra. Number 211 in Graduate Texts in Mathematics. Springer-Verlag, New York, third enlarged edition, 2002. Google Scholar
  15. Yinan Li and Youming Qiao. Linear algebraic analogues of the graph isomorphism problem and the Erdős-Rényi model. In Chris Umans, editor, 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, pages 463-474. IEEE Computer Society, 2017. arXiv:1708.04501, version 2. URL: https://doi.org/10.1109/FOCS.2017.49.
  16. Eugene M. Luks. Permutation groups and polynomial-time computation. In Groups and computation (New Brunswick, NJ, 1991), volume 11 of DIMACS Ser. Discrete Math. Theoret. Comput. Sci., pages 139-175. Amer. Math. Soc., Providence, RI, 1993. Google Scholar
  17. Jacques Patarin. Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms. In Advances in Cryptology - EUROCRYPT '96, International Conference on the Theory and Application of Cryptographic Techniques, Saragossa, Spain, May 12-16, 1996, Proceeding, pages 33-48, 1996. URL: https://doi.org/10.1007/3-540-68339-9_4.
  18. Nitin Saxena. Morphisms of rings and applications to complexity. PhD thesis, Indian Institute of Technology, Kanpur, May 2006. URL: https://www.cse.iitk.ac.in/users/nitin/papers/thesis.pdf.
  19. H. Weyl. The classical groups: their invariants and representations, volume 1. Princeton University Press, 1997. Google Scholar
  20. James B. Wilson. Decomposing p-groups via Jordan algebras. J. Algebra, 322:2642-2679, 2009. URL: https://doi.org/10.1016/j.jalgebra.2009.07.029.
  21. R. Wilson. The Finite Simple Groups, volume 251 of Graduate Texts in Mathematics. Springer London, 2009. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact