def find_p_q(nbits):

    p = getprime(nbits)
    while True:
        q = getprime(nbits)
        if not q == p: break
    
    return (p, q)
Returns a tuple of two different primes of nbits bits
dataset/ETHPy150Open CouchPotato/CouchPotatoServer/libs/rsa/_version133.py/find_p_q