Elliptic-curve cryptography (ECC) is built on something surprisingly simple: an elliptic curve drawn on a plane.

Imagine placing a few points on that curve. At first, they are just coordinates on a graph. But suppose we introduce a special rule for combining two of those points and producing another point on the same curve. Suddenly, the curve is no longer just a shape. It becomes a system in which we can perform arithmetic.

This may sound strange at first. We normally add numbers, not points on a curve. Do not worry if it is not yet clear what “adding points” means. We will build that idea visually and step by step in the following articles.

Once this arithmetic is in place, we can begin repeating operations on the curve. Some calculations are easy to perform, even when repeated many times, but extremely difficult to reverse. This property of being easy going forward but hard going backward is what eventually makes elliptic curves useful for cryptography.

This asymmetry — being easy to compute in one direction but computationally difficult to reverse—is a highly desirable property used throughout asymmetric cryptography. Elliptic-curve systems rely on the discrete logarithm problem, while RSA relies on the difficulty of factoring large composite integers

However, we will not begin with cryptographic protocols, private keys, or signatures. Starting there would hide the most interesting part: where the underlying mathematical structure comes from.

Instead, we will begin with ordinary curves over the real numbers—the smooth curves we can draw and explore on a graph. This allows us to see how points behave and how geometry can be turned into arithmetic.

We will then move from smooth curves to finite fields. The continuous curve will appear to break apart into a finite collection of individual points. Although it looks very different, the arithmetic we developed will still work. This finite and exact version is the one that computers can use.

Finally, we will look at how cryptographic systems choose particular points and groups within these curves.

By the end of the collection, the goal is for elliptic-curve cryptography to feel less like a collection of mysterious formulas and more like the natural result of a few ideas built on top of one another:

1. Where this collection stops

This collection focuses on the mathematical foundation behind elliptic-curve cryptography. It explains how curves, finite fields, point addition, scalar multiplication, base points, and groups fit together.

It does not yet explain complete cryptographic protocols or their security in detail. A later collection will use this foundation to explore public and private keys, digital signatures, key agreement, encryption, and threshold cryptography.

For now, we will temporarily put cryptography aside and begin with the curve itself in Elliptic Curves Over Real Numbers.