Pubcrypt v1.3
Update of the get_prime_factor algorithm. Instead of calling the function two times, we call it once and returning p and q at the same time. I also added another required condition that I haven't implemented for the keypair generation.
Which is: If (|p – q| ≤ 2nlen/2 – 100)