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

1 Expert Approved Answer
Step: 1 Unlock

if the integers p and q are in range n log n n log n we ca... View full answer

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

Document Format (2 attachments)

PDF file Icon

2036_60f58f34e92b8_835698.pdf

180 KBs PDF File

Word file Icon

2036_60f58f34e92b8_835698.docx

120 KBs Word File

Students Have Also Explored These Related Data Structures Algorithms Questions!