Question: Suppose there are two users on a network. Let their RSA moduli be n1 and n2 with n!=n2. If you are told thatn1andn2arenotrelatively prime, how
Suppose there are two users on a network. Let their RSA moduli be n1 and n2 with n!=n2. If you are told thatn1andn2arenotrelatively prime, how would you break their system?
(Please answer this one) Suppose you know that the two primes in the RSA algorithm are distance k apart. Explain how you can efficiently determine n (the product of the two primes) and hence break RSA, yet again.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
