在Python中采样大于p的n个随机素数的最快方法？

import random

def is_prime(n, k=5):
    if n <= 1:
        return False
    if n <= 3:
        return True
    if n % 2 == 0 or n % 3 == 0:
        return False

    # 进行Miller-Rabin测试
    for _ in range(k):
        a = random.randint(2, n - 2)
        x = pow(a, n - 1, n)
        if x != 1:
            return False

    return True

def generate_primes(p, n):
    primes = []
    num = p + 1
    while len(primes) < n:
        if is_prime(num):
            primes.append(num)
        num += 1

    return primes

p = 1000  # 设置起始值
n = 5     # 设置需要采样的素数个数
primes = generate_primes(p, n)
print(primes)