Fast constructive recognition of black-box unitary groupsAbstract: In this paper, the author presents a new algorithm to recognise, constructively, when a given black-box group is a homomorphic image of the unitary group SU(d,q) for known d and q. The algorithm runs in polynomial time, assuming the existence of oracles for handling SL(2,q) subgroups, and for computing discrete logarithms in cyclic groups of order q ± 1. |
| This paper is available as | (389 KB). |
All papers published in the LMS JCM are covered by a copyright agreement with the authors. Access to the papers is bound by this agreement; click here for details.
Go to the Volume 6 index
Return to the LMS JCM Homepage