Can the following problem be solved in polynomial time? Given a prime p, a value x ? -1 and y :-: gz 1/z mod p. If your answer is "yes," give a polynomial-time algorithm. If your answer is "no," show a reduction to one of the assumptions introduced in this chapter. mod p (where g is a uniform value in Z ), find g, i.e., compute y 95