Function generate_large_prime

ciphers/rabin_miller.py:213–217

(keysize: int = 1024)

def generate_large_prime(keysize: int = 1024) -> int:
    while True:
        num = random.randrange(2 ** (keysize - 1), 2 ** (keysize))
        if is_prime_low_num(num):
            return num


if __name__ == "__main__":