The Pohlig-Hellman method generalized for group structure computation

We present a new algorithm that extends the techniques of the Pohlig-Hellma n algorithm for discrete logarithm computation to the following situation: given a finite Abelian group and group elements h, g(1),..., g(1), compute the least positive integer y and numbers x(1),..., x(1) such that h(y) = Pi gi(xi). This computational problem is important for computing the structur e of a finite Abelian group. (C) 1999 Academic Press.