def is_good_prime(self, p): return p % 4 == 3 and MillerRabin.is_prime(p)
def generate_prime(num_bit): x = generate_bbs(num_bit) while not MillerRabin.is_prime(x): x = generate_bbs(num_bit) return x
def is_good_prime(self, p): return p % 4 == 3 and MillerRabin.is_prime(p)
def generate_prime(num_bit): x = generate_bbs(num_bit) while not MillerRabin.is_prime(x): x = generate_bbs(num_bit) return x