Many applications use elliptic curves mod 2, or elliptic curves defined over the finite fields (these are described in Section 3.11). This is often because mod 2 adapts well to computers. In 1999, NIST recommended 15 elliptic curves for cryptographic uses (see [FIPS 186-2]). Of these, 10 are over finite fields
If we’re working mod 2, the equations for elliptic curves need to be modified slightly. There are many reasons for this. For example, the derivative of is since is the same as 0. This means that the tangent lines we compute are vertical, so for all points A more sophisticated explanation is that the curve has singularities (points where the partial derivatives with respect to and simultaneously vanish).
The equations we need are of the form
where are constants. The addition law is slightly more complicated. We still have three points adding to infinity if and only if they lie on a line. Also, the lines through are vertical. But, as we’ll see in the following example, finding from is not the same as before.
Let As before, we can list the points on
Let’s compute The line through these two points is Substituting into the equation for yields which can rewritten as The roots are Therefore, the third point of intersection also has Since it lies on the line it must be (This might be puzzling. What is happening is that the line is tangent to at and also intersects in the point ) As before, we now have
To get we need to compute This means we need to find such that A line through is still a vertical line. In this case, we need one through so we take This intersects in the point We conclude that Putting everything together, we see that
In most applications, elliptic curves mod 2 are not large enough. Therefore, elliptic curves over finite fields are used. For an introduction to finite fields, see Section 3.11. However, in the present section, we only need the field which we now describe.
Let
with the following laws:
for all
for all
for all
Addition and multiplication are commutative and associative, and the distributive law holds: for all
Since
we see that is the multiplicative inverse of Therefore, every nonzero element of has a multiplicative inverse.
Elliptic curves with coefficients in finite fields are treated just like elliptic curves with integer coefficients.
Consider
where is as before. Let’s list the points of with coordinates in
The points on are therefore
Let’s compute The line through these two points is Substitute this into the equation for
which becomes This has the roots The third point of intersection of the line and is therefore so
We need namely the point with The vertical line intersects in so
For cryptographic purposes, elliptic curves are used over fields with large, say at least 150.