Question: Suppose the primes p and q used in the RSA cryptosystem, to define n = pq, are in the range [n log n, n
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.
Step by Step Solution
3.49 Rating (166 Votes )
There are 3 Steps involved in it
if the integers p and q are in range n log n n log n we ca... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (2 attachments)
2036_60f58f34e92b8_835698.pdf
180 KBs PDF File
2036_60f58f34e92b8_835698.docx
120 KBs Word File
