Finding N̷e̷m̷o̷ Prime Numbers

RSA gains its key security strength from the multiplication of two prime numbers (p and q) to get N. If we get p and q, then we can work out:

Phi = (p-1)(q-1)

And since we have encryption key (e), and which is normally 65,537, we solve for d in:

d x e mod (PHI) = 1