Suppose the primes p and q used in the RSA cryptosystem, to define n = pq, are

Question:

Suppose the primes p and q used in the RSA cryptosystem, to define n = pq, are in the range [√n − log n, √n + log n]. Explain how you can efficiently factor n using this information.

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question

Algorithm Design And Applications

ISBN: 9781118335918

1st Edition

Authors: Michael T. Goodrich, Roberto Tamassia

Question Posted: