< ^ From:

^ Subject:

If you mean the generalized DLP for permutation groups then

there is a paper: Torsten Minkwitz, "An algorithm for solving the

factorization problem in permutation groups", J. Symbolic Comput. 26

(1998) 89-95 in which the author discusses this problem. He describes

how to solve it using a stabilizer chain and strong generating set, and

a method of reducing the lengths of the words which are obtained. His

program is given in pseudocode, and he gives sample running times for a

GAP program which he wrote.

- John D. Dixon

Miguel A. Borges Trenard wrote:

> Dear GAP forum,

> I would like to know how to solve the Discrete Logarithmic Problem by

> means of GAP.

> Probably, it could be solved by using a stabilizer chain but I don't

know

> how.

> Thank you, Miguel Angel Borges-Trenard.

> < [top]