More on RSA]
Suppose we tried to simplify the RSA cryptosystem by using just a prime p instead of the composite modulus N = pq. As in RSA, we would have an encryption exponent e that is relatively prime to p - 1, and the encryption of message x would be x e mod p. Show that this scheme is not secure by giving an ef?cient algorithm that, given p, e and x e mod p, computes x mod p. Be sure to justify the correctness and analyze the running time of your algorithm