Abstract

All non-abelian finite simple groups can be symmetrically generated by involutions. An algorithm which performs coset enumeration for a group defined in this manner on the cosets of a subgroup of automorphisms of these involutions is presented.