Problem 7 | Discrete logarithms with respect to differentprimitive roots
Prove that the difficulty of the discrete logarithm problem isindependent of the primitive root.
Specifically, for any prime p, assuming that it is computationallyfeasible to extract discrete
logarithms with respect to one primitive root of p, show how onecan feasibly extract discrete
logarithms with respect to any other primitive root of p.
