Abstract
We study the isomorphism problem of two “natural” algebraic structures – \(\mathbb{F}\)-algebras and cubic forms. We prove that the \(\mathbb{F}\)-algebra isomorphism problem reduces in polynomial time to the cubic forms equivalence problem. This answers a question asked in [AS05]. For finite fields of the form \(3 \Lambda(\#\mathbb{F} - 1)\), this result implies that the two problems are infact equivalent. This result also has the following interesting consequence:
Graph Isomorphism \({\leq}^P_m\) \(\mathbb{F}\)-algebra Isomorphism \({\leq}^P_m\) Cubic Form Equivalence.
This work was done while the authors were visiting National University of Singapore. The second author was also supported by research funding from Infosys Technologies Limited, Bangalore.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Agrawal, M., Saxena, N.: Automorphisms of Finite Rings and Applications to Complexity of Problems. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 1–17. Springer, Heidelberg (2005)
Brownawell, W.D.: Bounds for the degrees in the Nullstellensatz. Annals of Maths 126, 577–591 (1987)
Courtois, N., Goubin, L., Patarin, J.: Improved Algorithms for Isomorphism of Polynomials. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 184–200. Springer, Heidelberg (1998)
Davenport, J., Heintz, J.: Real Quantifier Elimination Is Doubly Exponential. Journal of Symbolic Computation 5, 29–35 (1988)
Harrison, D.: A Grothendieck ring of higher degree forms. Journal of Algebra 35, 123–128 (1975)
Kayal, N., Saxena, N.: On the Ring Isomorphism and Automorphism Problems. In: IEEE Conference on Computational Complexity, pp. 2–12 (2005)
Lang, S.: Algebra, 3rd edn. Addison-Wesley, Reading
McDonald, B.R.: Finite Rings with Identity. Marcel Dekker, Inc., New York (1974)
Manin, Y.I., Hazewinkel, M.: Cubic forms: algebra, geometry, arithmetic. North-Holland Publishing Co., Amsterdam (1974)
Patarin, J.: Hidden Field Equations (HFE) and Isomorphisms of Polynomials (IP): Two new families of asymmetric algorithms. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 33–48. Springer, Heidelberg (1996)
Rupprecht, C.: Cohomological invariants for higher degree forms. PhD Thesis, Universität Regensburg (2003)
Schoning, U.: Graph isomorphism is in the low hierarchy. Journal of Computer and System Science 37, 312–323 (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Agrawal, M., Saxena, N. (2006). Equivalence of \(\mathbb{F}\)-Algebras and Cubic Forms. In: Durand, B., Thomas, W. (eds) STACS 2006. STACS 2006. Lecture Notes in Computer Science, vol 3884. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11672142_8
Download citation
DOI: https://doi.org/10.1007/11672142_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32301-3
Online ISBN: 978-3-540-32288-7
eBook Packages: Computer ScienceComputer Science (R0)