So doing a little research on RSA, and knowing the public key contains N. So breaking down the steps to cracking it, I'd have to search for P and Q (which takes a very long time as I understand it), (where P*Q = N). aka, prime 1 and prime 2.
So it takes a long time to find a suitable prime pair. For me I see 2 actions and I want to know which action takes the longer time.
- Finding a 1024 prime number.
- Having 1 prime number and dividing N by testable prime number to see if it produces another prime, aka prime 2.
So is the time mostly spent finding prime 1 and THEN trying to factor out N, or is the time spent finding a large prime, but its easy to divide N by prime 1 and see it not work?
Sorry if this is confusing, I am having a hard time constructing the question.