"""Returns a tuple of two different primes of nbits bits"""
pbits = nbits + (nbits/16) #Make sure that p and q aren't too close
qbits = nbits - (nbits/16) #or the factoring programs can factor n
- #Make sure p and q are different and phi_n is not divisible by 256
- if not (q == p or phi_n & 255 == 0): break
+ #Make sure p and q are different.