ECC bounce visualizer

Billiards on a curve.

Elliptic curve cryptography is a math game with one rule: given a starting point G and a number of bounces n, compute n·G. Forward — milliseconds. Backward — infeasible. That asymmetry is the trapdoor that protects every modern HTTPS connection. And a CRQC running Shor’s collapses it.

n = 1 / 12

Current point

(1.000, 1.732)

1·G

Bounces taken

We start at G.

Back to the source

Modern Cryptography in Action

Elliptic Curve Cryptography

Cryptographic Foundations

How RSA Works

About this lab — ECC Bounce Visualizer

What this lab teaches

Why elliptic-curve cryptography is a one-way street: adding a point to itself over and over is easy, but recovering how many times you did it — the discrete logarithm — is infeasible, until Shor's algorithm.

How to use it

Step the point addition and watch the 'bounce' trace across the curve.
Try to recover the multiplier from the start and end points alone — that is the hard problem.

Key takeaway

ECC's security rests on the Elliptic Curve Discrete Log Problem. Shor's algorithm solves it efficiently, which puts ECC — like RSA — on the wrong side of the quantum line.