Elliptic Curve Cryptography (ECC) is the backbone of modern security, protecting everything from Bitcoin to your WhatsApp messages.
We define a curve using the Weierstrass equation:
y² = x³ + ax + b
By adjusting a and b, we change the curve's shape. Use the sliders on the right to see this.
a
b
In this mode, we see the curve over real numbers. The magic is in Point Addition.
To add two points P and Q:
P
Q
-R
R = P + Q
Try dragging the points P (pink) and Q (blue) to see the yellow sum point move!
Computers can't handle infinite precision real numbers. So we wrap the curve around a Finite Field of integers modulo a prime number p.
p
The equation becomes:
y² ≡ x³ + ax + b (mod p)
The smooth curve turns into a cloud of points. But the addition rule still applies mathematically!
Security comes from the Discrete Logarithm Problem.
It's easy to calculate Q = n * P (adding P to itself n times). This is like a billiard ball bouncing around the grid.
Q = n * P
But if I give you Q and P, it is extremely hard to find n. The point jumps so chaotically that you can't retrace the steps.
n
Try it: Switch to Crypto Mode and click "Animate". Watch how just adding 1 to n makes the point jump wildly.