Let N be a product of two distinct primes, i.e. N = p.q. Show that if...

 

Transcribed Image Text:

Let N be a product of two distinct primes, i.e. N = p.q. Show that if N and (N) are known, then it is possible to compute p and q in polynomial time (in the bitlength of N). Hint: If you do not know the time complexity of some operation you need to perform, come up with a simple algorithm yourself. Let N be a product of two distinct primes, i.e. N = p.q. Show that if N and (N) are known, then it is possible to compute p and q in polynomial time (in the bitlength of N). Hint: If you do not know the time complexity of some operation you need to perform, come up with a simple algorithm yourself.