def find_p_q(nbits):
 p = getprime(nbits)
 while True:
  q = getprime(nbits)
  if (not (q == p)):
   break
 return (p, q)

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 .