Question: Need Help on this problem 1. Let Mi = 10749. (a) Use Lenstra's Elliptic Curve Factorization Algorithm to factor M1. (b) Suppose Alice and Bob

Need Help on this problem

Need Help on this problem 1. Let Mi = 10749. (a)
1. Let Mi = 10749. (a) Use Lenstra's Elliptic Curve Factorization Algorithm to factor M1. (b) Suppose Alice and Bob are exchanging messages using RSA. Alice's public key is (N, e) = (10749, 55). Bob uses this to encrypt his message; he sends Alice the ciphertext c = 10618. Use your work in part a to decrypt Bob's message. Then decode the message using the ASCII table. (c) Now let N2 = 10763 = 47 * 229. Discuss the security of using M and N2 in RSA. Which value is more secure against an attack by Lenstra's algorithm? Which value is more secure against an attack by Fermat factorization? Which is more secure against an attack by Pollard's p-1 method? Be as specific as possible (discuss the number of steps for each algorithm)

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Mathematics Questions!