Algorithms Based on *Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing
Ivanyos, Gábor and Qiao, Y (2019) Algorithms Based on *Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing. SIAM JOURNAL ON COMPUTING, 48 (3). pp. 926963. ISSN 00975397 10.1137/18M1165682
Text
Ivanyos_926_30747421_z.pdf Restricted to Registered users only Download (466kB)  Request a copy 

Text
Ivanyos_926_30747421_ny.pdf Download (487kB) 
Abstract
We consider two basic algorithmic problems concerning tuples of (skew)symmetric matrices. The first problem asks us to decide, given two tuples of (skew)symmetric matrices (B1, . . . , Bm) and (C1, . . . , Cm), whether there exists an invertible matrix A such that for every i is an element of{1, . . . , m}, A(t)B(i)A = Ci. We show that this problem can be solved in randomized polynomial time over finite fields of odd size, the reals, and the complex numbers. The second problem asks us to decide, given a tuple of square matrices (B1, . . . , Bm), whether there exist invertible matrices A and D, such that for every i is an element of{1, . . . , m}, AB(i)D is (skew)symmetric. We show that this problem can be solved in deterministic polynomial time over fields of characteristic not 2. For both problems we exploit the structure of the underlying *algebras (algebras with an involutive antiautomorphism) and utilize results and methods from the module isomorphism problem. Applications of our results range from multivariate cryptography to group isomorphism and to polynomial identity testing. Specifically, these results imply efficient algorithms for the following problems. (1) Test isomorphism of quadratic forms with one secret over a finite field of odd size. This problem belongs to a family of problems that serves as the security basis of certain authentication schemes proposed by Patarin [J. Patarin, in Advances in Cryptology, EUROCRYPT '96, Springer, Berlin, 1996, pp. 3348]. (2) Test isomorphism of pgroups of class 2 and exponent p (p odd) with order p(l) in time polynomial in the group order, when the commutator subgroup is of order pO((root l)). (3) Deterministically reveal two families of singularity witnesses caused by the skewsymmetric structure. This represents a natural next step for the polynomial identity testing problem, in the direction set up by the recent resolution of the noncommutative rank problem [A. Garg et al., in Proceedings of the 57th Annual IEEE Symposium on Foundations of Computer Science (FOCS), IEEE, Washington, DC, 2016, pp. 109117; G. Ivanyos, Y. Qiao, and K. V. Subrahmanyam, in Proceedings of the 8th Innovations in Theoretical Computer Science (ITCS) Conference, Berkeley, CA, 2017, 23].
Item Type:  Article 

Uncontrolled Keywords:  MATRICES; COMPLEXITY; Time algorithms; Computer Science, Theory & Methods; Polynomial identity testing; multivariate cryptography; group isomorphism problem; involutive algebra; ARITHMETIC CIRCUITS; 
Subjects:  Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány 
Divisions:  Informatics Laboratory 
SWORD Depositor:  MTMT Injector 
Depositing User:  MTMT Injector 
Date Deposited:  10 Oct 2019 15:21 
Last Modified:  10 Oct 2019 15:21 
URI:  http://eprints.sztaki.hu/id/eprint/9815 
Update Item 