Elliptic Curve Point Operations
What You'll Learn
You'll learn the three fundamental mathematical operations that make elliptic curve cryptography work: point addition, point doubling, and scalar multiplication.
The Core Operations
Now that you understand what elliptic curves look like (from the previous lesson), we need to perform calculations on them. These operations happen entirely on the curve itself—no point ever leaves the curve.
Point Addition
When you "add" two different points P and Q on an elliptic curve, you draw a line through them. This line intersects the curve at a third point. Reflect that point across the x-axis, and you've got P + Q. It's geometric addition, not regular arithmetic.
Analogy: Think of it like billiards—you shoot from P through Q, hit the curve's edge, and the "reflection" is your answer.
Point Doubling
What if you need to add a point to itself (P + P)? You can't draw a line through two identical points, so instead you draw the tangent line at P. Where it intersects the curve again, reflect that point—that's 2P.
Scalar Multiplication
This is where the magic happens for cryptography. To compute kP (a point P added to itself k times), you use repeated doubling and adding—like computing 15P by doing ((2P) + P) doubled, then doubled again, then add P.
This operation is fast to compute but extremely hard to reverse (the discrete logarithm problem). That's why protocols like ECDH work: you can easily compute your private key times the base point, but an attacker can't figure out your private key from the result.
Key Takeaway: Point addition, doubling, and scalar multiplication are the building blocks of elliptic curve cryptography—they enable the one-way mathematical functions that secure ECDH and ECDSA.