Core idea: A finite-field curve is computed directly from its modular equation. It is not a cropped, rounded, or wrapped image of the real curve.
Construct the point group
For each x∈Fp:
- Compute r=x3+ax+b(modp).
- Find every y with y2≡r(modp).
- Collect each matching (x,y), then add the identity O.
A nonzero quadratic residue normally gives the inverse pair (x,y) and (x,p−y); zero gives (x,0); a non-residue gives no point.
For
y2≡x3+x+1(mod11),
there are 13 affine points and O, so #E(F11)=14.
Add finite-field points
Use the same group law algebraically. For P=(x1,y1) and Q=(x2,y2):
λ={(y2−y1)(x2−x1)−1,(3x12+a)(2y1)−1,P=Q,P=Q,(modp)
x3=λ2−x1−x2,y3=λ(x1−x3)−y1(modp).
Division means multiplication by a modular inverse. Also, P+(−P)=O and 2(x,0)=O.
Validity: Require 4a3+27b2≡0(modp). Production curves use the same construction and operation at an enormous scale.
Next: Measure scalar cycles and select a prime-order subgroup.