Warning: some curves needs recalculation for p%8==5 - vjudeu/curves1000 GitHub Wiki

bits=256
p=2^bits-2^32
p=previous_prime(p)
while (p%4 != 3) and (p%8 != 5):
    p=previous_prime(p)
is_running=True
while is_running:
    b_value=3
    n=4
    while (not is_prime(n)) and (b_value<9):
        P=GF(p)
        aP=P(0x0)
        bP=P(b_value)
        curve=EllipticCurve(P,(aP,bP))
        n=curve.order()
        if is_prime(n):
            print("success: p="+hex(p)+", b="+hex(b_value)+", n="+hex(n))
            is_running=False
        else:
            b_value+=2
    if not is_prime(n):
        print("failed: p="+hex(p))
        p=previous_prime(p)
        while (p%4 != 3) and (p%8 != 5):
            p=previous_prime(p)