Elliptic Curve Cryptography

When your browser loads a page over a secure connection, two computers need to agree on a shared secret. They do this over an open line that anyone can listen in on. For this, there are computational problems that are easy to solve in one direction and practically unsolvable in the other. Elliptic Curve Cryptography is just such a problem: it uses points on a particular kind of curved line, known as an elliptic curve. You can string these points together over and over according to fixed rules. But from the result, it is nearly impossible to work backward and figure out how many times this was done.

Short keys, same security

The great advantage lies in the key lengths. A key is simply a very long number, and the longer it is, the more computational work it requires. With the older RSA method, you now need around 3072 bits to be considered secure. An elliptic curve achieves the same security level with just 256 bits. That’s roughly twelve times shorter.

Short here means fast and efficient. Establishing a connection to a website costs less computing time, and less data needs to be transmitted. Across billions of connections per day, this adds up to substantial savings in electricity and server capacity. For small devices, the difference matters even more. A smart card, a car key, or a pacemaker has barely any computing power and often only a tiny battery.

A common misconception is that ECC is generally more secure than RSA. That’s not quite true. Both are considered secure against today’s computers when using an appropriate key length. ECC is primarily more efficient. And both share the same weakness: a sufficiently large quantum computer could break them. That’s why research is already underway on successor methods.

Adding points instead of multiplying numbers

An elliptic curve is the set of all points that satisfy a particular equation. In cryptography, it doesn’t look like a smooth line but consists of a vast scattering of individual points. For these points, there is a computational rule called addition. Taking two points, the rule uniquely produces a third point on the same curve.

Now you choose a fixed starting point and add it to itself many times. How many times you do this is the private key — the secret. The point you end up at is the public key and may be seen by anyone. Security rests on the fact that no one can work backward from the endpoint to determine the number of steps. Experts call this problem the discrete logarithm on elliptic curves.

An analogy helps: imagine a billiard ball bouncing again and again off the many cushions of a table. You know the starting direction, and you see where the ball ends up. But you can’t tell how many cushions it touched along the way. This one-way street is exactly the core of the method.

From the browser lock icon to the Bitcoin address

You encounter ECC most often while browsing, without even noticing. The lock icon in the address bar signals an encrypted connection, and the key exchange behind it today usually runs over elliptic curves. Messaging apps like Signal or WhatsApp also build their end-to-end encryption on this foundation. The same applies to logging into servers via SSH.

ECC is highly visible in the crypto world. A Bitcoin address is, at its core, a public key on the curve secp256k1. Whoever initiates a transfer signs it with the matching private key. If someone loses that key, the funds are irretrievably gone. The electronic ID card and modern passkeys used instead of passwords also rely on the same technology.

In the news, the term usually comes up in connection with quantum computers. Agencies such as the US institute NIST have therefore already standardized new, quantum-safe methods. But it will take years before these are built into everything. In the meantime, elliptic curves remain the standard for nearly everything encrypted on the internet.