The cyclic group case is the discrete logarithm problem, but I don’t know what keyword to use for other cases.
What I’m really interested in is the symmetric group. If I have a fixed set of permutations, how do i combine them into the one I want?
The cyclic group case is the discrete logarithm problem, but I don’t know what keyword to use for other cases.
What I’m really interested in is the symmetric group. If I have a fixed set of permutations, how do i combine them into the one I want?
do you mean something like this: https://www.math.colostate.edu/~hulpke/talks/decomp.pdf
At a glance this looks like exactly what I was thinking of! Thank you.