[Quantum Computing Lab Preview] Elliptic Curve Discrete Logarithm Problem (ECDLP) Simulator

This is an Elliptic Curve Cryptography (ECC) simulator focusing on SECP256k1-like curves: y² = x³ + 7 mod p (with much smaller p and order N in this simulator). The 256-bit prime field P and 256-bit order N that are impossible to solve in both classic and quantum settings. Pick a curve based on the subgroup of order n = 2^s - 1, then generate a public point (public key) Q = kG and run k-recovery routines.

Try Shor's Algorithm on a tiny elliptic curve now!! More quantum algorithms visualized soon!!

Classical computing

No runs yet.