Is finding "a" given g, g^a, and g^(a^-1) mod p intractable?

72 Views Asked by At

Obviously, the discrete logarithm problem is thought to be hard.

But what if you are also given $g^\left(a^{-1}\right)$?

Does that give enough information to solve for $a$? Or is that also intractable?