Elliptic-Curve Cryptography (ECC)

Public-key techniques built on algebraic curves, giving strong security with shorter keys.

Difficulty: Advanced

How it works

  1. ECC works with points on an elliptic curve defined over a finite field. Adding points repeatedly creates a hard mathematical problem called the elliptic-curve discrete logarithm problem.
  2. A private key is chosen as a random large integer. The corresponding public key is a point obtained by repeatedly adding a fixed base point to itself that many times.
  3. Key-exchange schemes like ECDH let two parties derive a shared secret by combining their private key with the other party’s public key.
  4. Signature schemes like ECDSA and EdDSA let you prove that a message was created by someone who holds the private key without revealing the key itself.
  5. ECC achieves comparable security to RSA with much smaller key sizes, which is why it is widely used in modern protocols and constrained devices.

Keys are generated automatically for this demonstration.

Press Shift + Enter

What is it?

Elliptic-Curve Cryptography (ECC) is a modern approach to public-key cryptography based on the algebraic structure of elliptic curves over finite fields. ECC can provide the same level of cryptographic security as RSA but with significantly smaller keys. For instance, a 256-bit ECC key offers comparable security to a 3072-bit RSA key. This massive reduction in key size leads to faster computations, lower power consumption, and reduced memory usage, making ECC the preferred choice for mobile devices, modern web traffic, and cryptocurrencies.

Try it yourself

Can you decrypt this challenge?

VHVY GUVF ZRNGL (example ciphertext)

Where this shows up today

To achieve robust public-key security with dramatically smaller key sizes than RSA.