Elliptic Curves – Part 2
This post aims to clarify some of the background on elliptic crves over finite fields. I want to give some intuition on what an elliptic curve is, where the point at infinity comes from, and some cool things you can do with elliptic curves. In this post, we are working over a field , and its multiplicative group
.
Elliptic curves are defined over the projective plane . Simply put, on a regular plane, parallel lines never intersect. The projective plane can be thought of as a regular plane, with an extra point called the point at infinity where parallel lines intersect. We need to define what we mean by a curve on
. We need that if
is on the curve, then
also is, for all
. In particular, if
is the equation of a projective curve, then
must satisfy
. So
needs to be a homogeneous polynomial.
For now, we will assume that , that is,
. Then one can simplify the general homogeneous polynomial of degree 3 as follows:
. You can see that this looks similar to the equation for an elliptic curve I gave last time.
First, we want to find the point at infinity. We want , and we know that the point at infinity is where
. But this implies that
, so the point at infinity is
, since scalar multiples are the same point. We call this point
, and it is on every elliptic curve.
The one additional condition we place on an elliptic curve is that the points must be non-singular. This means that is non-zero. Again, we work with
. We can calculate
. Then we have that
, which is non-zero. Hence the point at infinity is on every elliptic curve.
Now, let’s get back to finding the equation of a general elliptic curve. For all the affine points, . Hence
. Thus
. This is called the
of an elliptic curve. Now we have almost managed to properly define elliptic curves.
For the affine points, we have that . Hence a point
is non-singular if and only if
or
. Using this, we can deduce that the equation defines an elliptic curve if and only if
. We call
the discriminant of the elliptic curve.
To finish up, I will mention two applications of elliptic curves. They can be used to share a secret key with a similar method as the discrete logarithm Diffie-Hellman key exchange. They can also be used to factor large integers, using an algorithm called Lenstra Elliptic Curve Factorisation. This method is based on adding points of elliptic curves. A basic outline of the algorithm is as follows. Given an integer , choose an elliptic curve
over
and a point on this curve. Add this point to itself until calculating the sum gives a non-invertible denominator
. Then applying Euclid’s Algorithm, you get
as a non-trivial factor of
.