Question: Crypto Invent an efficient method to factor an RSA modulus of the form pq if you happen to know that p and q are consecutive
Crypto
Invent an efficient method to factor an RSA modulus of the form pq if you happen to know that p and q are consecutive primes. Bound the (expected or absolute)running time of your algorithm(as afunction of the log of the input size). (You might want to do some research on the distribution of prime to help).
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
