ECC (Elliptic Curve Cryptography) : Session 6

Overview

This session introduced elliptic curve cryptography as the modern, more efficient alternative to traditional public-key systems like RSA. Participants explored the geometry of point addition and scalar multiplication on elliptic curves, the elliptic curve discrete logarithm problem that gives ECC its security, and why ECC achieves RSA-equivalent security with dramatically smaller keys — setting up the foundation for the digital signature scheme covered in the final session.

Deep Dive

The session introduced elliptic curves as curves defined by an equation of the form y² = x³ + ax + b over a finite field, rather than over the real numbers typically seen in school mathematics. Participants explored the geometric intuition of point addition on the curve — where drawing a line through two points on the curve and reflecting the third intersection point across the x-axis defines a new point — and point doubling, a special case used for repeated addition.

From these operations, scalar multiplication (kP, adding a point P to itself k times) was introduced as the core operation in elliptic curve cryptography — directly analogous to modular exponentiation (g^x mod p) in classic Diffie-Hellman.

The Elliptic Curve Discrete Logarithm Problem (ECDLP) was then defined: given a base point P and the result Q = kP, it is computationally infeasible to recover k. Crucially, the session emphasized that ECDLP is believed to be significantly harder to solve than the classic discrete logarithm problem or integer factorization (RSA's underlying hard problem) for equivalent key sizes — which is precisely why ECC can offer the same security level as RSA with dramatically smaller keys.

A comparison table was discussed showing approximate equivalent security levels:

A 256-bit ECC key provides security roughly comparable to a 3072-bit RSA key.

This translates to faster computations, smaller certificates/signatures, less bandwidth, and lower power consumption — a critical advantage for mobile devices and IoT systems.

The group discussed ECDH (Elliptic Curve Diffie-Hellman) as the direct elliptic-curve analog of the classic Diffie-Hellman protocol covered in Session 2 — the same key exchange logic, but using elliptic curve point operations instead of modular exponentiation, offering the efficiency benefits just discussed.

Common named curves were introduced, including secp256k1 (used in Bitcoin and Ethereum) and the NIST P-256 curve (widely used in TLS), along with a brief, balanced discussion of the historical controversy around NIST-standardized curves and why some systems (like Bitcoin) deliberately chose alternative curve parameters.

Learning Points

Understand the geometric and algebraic structure of elliptic curves used in cryptography.

Learn the elliptic curve discrete logarithm problem (ECDLP) and why it enables smaller key sizes.

Compare ECC to RSA in terms of security and performance.

Markdown

Outcome :

Understood the geometric operations (point addition, doubling, scalar multiplication) behind elliptic curves.

Learned why ECC achieves RSA-equivalent security with significantly smaller key sizes.

Understood ECDH as the elliptic-curve analog of classic Diffie-Hellman.

Gained awareness of commonly used curves (secp256k1, P-256) and their real-world applications.

Summary

ECC was presented as the modern, efficient foundation for public-key cryptography used throughout the industry today, setting up the mathematical foundation needed to understand the digital signature scheme covered in the closing session .