Earth Sciences homework help. 5. [More on RSA]Suppose we tried to simplify the RSA cryptosystem by using just a prime p instead of the composite modulusN = pq. As in RSA, we would have an encryption exponent e that is relatively prime to p ? 1, and theencryption of message x would be xe mod p. Show that this scheme is not secure by giving an ef?cientalgorithm that, given p, e and xe mod p, computes x mod p. Be sure to justify the correctness and analyzethe running time of your algorithm

Earth Sciences homework help