If you have an elliptic curve in the form:
y ^ 2 = x ^ 3 + a * x + b (mod p)
Is there a good program to calculate the number of points on this curve?
I read about the Schoof and Schoof-Elkies-Atkin (SEA) algorithm, but I'm looking for open source options. Does anyone know a good program that can do this?
Also, if a is 1 and b is 0, the SEA algorithm cannot be used since the j-invariant is 0. Is this correct?
Edit: this is in the context of cryptography with an elliptic curve
cryptography elliptic-curve
Omega
source share