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
Bestessayspaper.com is committed to providing all of its services strictly complying with the applicable laws and regulations; moreover keeping them within the boundaries of ethics. Accordingly, any of its services as offered on its website (essay/dissertation) must not be misunderstood.
For any questions, feedback, or comments, we have an ethical customer support team that is always waiting in line for your inquiries.
Talk to us
+1 (347) 670-5218