Elliptic Curves

Explore cubic curves and the remarkable elliptic curves. Discover the group law that makes them central to modern cryptography.

The Magic of Elliptic Curves

Moving beyond conics, we enter the fascinating world of cubic curves. The most important cubic curves are elliptic curves — smooth curves of the form y² = x³ + ax + b.

What makes elliptic curves special? They carry a natural group structure: you can "add" points on the curve to get new points. This remarkable property makes them essential for cryptography, number theory, and even proving Fermat's Last Theorem.

Demo 1: Weierstrass Form

Every elliptic curve can be written in Weierstrass form: y² = x³ + ax + b. Adjust the parameters and watch the curve change. The discriminant tells you when the curve becomes singular.

y² = x³ + (-1.0)x + (0.0)
Smooth Elliptic Curve

Smooth elliptic curve

Discriminant Δ = 64.00
Weierstrass form:Every elliptic curve can be written as y² = x³ + ax + b. The curve is smooth (non-singular) when Δ = -16(4a³ + 27b²) ≠ 0.

Demo 2: Nodes and Cusps

Watch what happens when an elliptic curve becomes singular. The curve can develop a node (self-crossing) or a cusp(sharp point). These singular curves are no longer elliptic curves!

y² = x³ + (1.00)x²
Node (t < 0)Cusp (t = 0)Smooth (t > 0)
Smooth Curve

No singular points — the curve is smooth everywhere.

As the parameter t decreases, the curve develops a singularity at the origin. At t = 0, we get a cusp. For t < 0, we get a nodewhere the curve crosses itself.

Demo 3: The Group Law

The chord-tangent method defines a way to "add" two points on an elliptic curve. Drag points P and Q to see how P + Q is computed. This operation makes the curve into a mathematical group!

y² = x³ - x
P (-0.50, 0.61)
Q (0.50, 0.50)
R' (third intersection)
P + Q (0.01, -0.55)

The Group Law (Chord-Tangent Method)

  1. Draw a line through points P and Q
  2. Find the third intersection point R' with the curve
  3. Reflect R' across the x-axis to get P + Q

This operation makes the curve into a group! It's associative, has an identity (point at infinity), and every point has an inverse.

Demo 4: Why Elliptic Curves Matter

Elliptic curves aren't just beautiful math — they power modern cryptography, helped prove Fermat's Last Theorem, and enable deep space communication.

🔐

Cryptography (ECDSA)

Bitcoin, Ethereum, and most modern cryptocurrencies use elliptic curve cryptography for digital signatures.

How it works:

  • Private key: a secret number n
  • Public key: the point P = n × G (G is a known base point)
  • Computing n from P is virtually impossible (discrete log problem)
  • Bitcoin uses the secp256k1 curve: y² = x³ + 7
Fun fact: A 256-bit elliptic curve key provides the same security as a 3072-bit RSA key, but is much smaller and faster!

Point Multiplication: The One-Way Function

n
Private Key
×
G
Base Point
=
P
Public Key

Easy to compute P from n, but virtually impossible to find n from P!

Elliptic curves aren't just beautiful mathematics — they're essential tools in modern technology, from securing your Bitcoin wallet to proving 350-year-old theorems.

Elliptic Curves Unlocked!

You've discovered the remarkable world of elliptic curves:

  • Weierstrass form: y² = x³ + ax + b with discriminant Δ ≠ 0
  • Singular curves: Nodes (crossing) and cusps (sharp points) when Δ = 0
  • Group law: Add points using the chord-tangent method
  • Cryptography: Bitcoin, Ethereum, and secure communication
  • Number theory: Fermat's Last Theorem, integer factorization

You've completed the Algebraic Geometry module! From simple curves to elliptic curves, from intersection theory to cryptographic applications — you've seen how polynomial equations create a bridge between algebra and geometry.