technologybriefs
10:46in productionCh. 1 · Two inventors, one idea, same year/ 10:46 · ceiling 15 min
Security

Elliptic-curve cryptography

Victor S. Miller and Neal Koblitz

ECC shrinks keys without shrinking security — but only if you pick the curve right, and only if the math holds.

ECC is a public-key method based on elliptic curves over finite fields. Proposed independently by Koblitz and Miller in 1985. Delivers equivalent security to RSA and ElGamal with smaller keys. Security rests on the hardness of the elliptic curve discrete logarithm problem — specifically, recovering scalar k from points P and Q = kP — and on efficient yet irreversible point multiplication for appropriate parameters.

SecurityCryptographyMathematicsComputingCryptography across the network →
Chapters & takeaways4
  1. 0:48
    Two inventors, one idea, same year

    Koblitz and Miller independently proposed ECC in 1985 — no collaboration, no shared paper, no prior art cited.

  2. 2:56
    A new mathematical substrate

    ECC is not a variant of RSA; it is built on elliptic curves over finite fields — a different algebraic foundation entirely.

  3. 4:44
    Smaller keys, same security

    A 256-bit ECC key matches the security of a 3072-bit RSA key — not because it’s faster, but because the underlying problem is harder to solve.

  4. 6:37
    Efficient forward, intractable backward

    Security depends on two things: fast point multiplication and the irreversible nature of that operation — both conditional on proper curve choice.

Worth your time?

Yes. Study the whole thing.

4.5/ 5
What works
  • reducing key size while preserving security level
  • enabling public-key crypto on low-power hardware
  • providing a distinct hardness assumption from integer factorisation
What does not
  • eliminate parameter-selection risk
  • guarantee implementation security
  • simplify PKI infrastructure
Study it if
  • embedded-systems engineers
  • protocol designers
  • cryptographic auditors
Skip it if
  • application developers who rely on TLS libraries without auditing curves
  • organisations using pre-2010 ECC implementations
The written brief1 min read

What it is and the problem it solves

ECC is a public-key cryptography method. It solves the problem of achieving strong encryption and digital signatures with smaller keys than RSA or ElGamal.

How it works

ECC uses the algebraic structure of elliptic curves over finite fields. It relies on point multiplication: given a point P and scalar k, computing Q = kP is efficient. Recovering k from P and Q is assumed intractable — the elliptic curve discrete logarithm problem (ECDLP).

What works

Smaller keys provide equivalent security to RSA and ElGamal. Point multiplication is efficiently computable. For well-chosen curves and key sizes, reversing that operation remains intractable.

What does not

ECC does not eliminate the need for careful parameter selection. Its security collapses if curves are weak, implementation leaks side channels, or the ECDLP is solved. It does not simplify key management, interoperability, or certificate validation.

What it changes

ECC changes the trade-off between key size and security. It enables public-key cryptography in resource-constrained environments — smart cards, embedded devices, mobile protocols — where RSA key sizes would be prohibitive.

Is it worth your time

Yes — if you work with constrained systems where key size, bandwidth or power matter. ECC delivers equivalent security to RSA or ElGamal with smaller keys, but only if curves and parameters are properly chosen.

Same field · Security4 of 8
8:32
Bitcoin2009Bitcoin is the first decentralized cryptocurrency. It solves double-spending without a trusted intermediary. Its mechanism relies on proof-of-work mining, public blockchain replication, and cryptographic key control. It delivers decentralisation, Sybil resistance, and Byzantine fault tolerance—but only if users protect private keys. It does not solve scalability, energy use, or usability. It changes what digital money can be—but not what it must be.
10:41
Diffie–Hellman key exchangeDiffie–Hellman key exchange is a foundational cryptographic protocol that enables two parties to derive a shared secret over an insecure channel using modular exponentiation in a finite group. Published in 1976, it introduced the first publicly known private–public key concept and remains embedded in internet infrastructure. But it provides no authentication—making it vulnerable to man-in-the-middle attacks unless combined with digital signatures or certificates.
10:45
HTTPS1994HTTPS is the foundational encryption layer for web traffic. It delivers real security in transit — but only when deployed with care. Its value lies not in novelty, but in necessity.
9:54
NXP Semiconductors1953NXP Semiconductors co-invented NFC with Sony and Inside Secure. Its chipsets enabled secure mobile payments and data exchange via short-range electromagnetic coupling. The technology works — but only within strict physical and cryptographic constraints. It changed how identity and value move at point-of-sale — yet offers no inherent security beyond what the host system implements. Worth your time if you build or integrate secure embedded systems.
Up next in Technology

Endoscope

Philipp Bozzini · 9:36

A light conductor that saw inside the body — but not far enough to win over physicians or enter practice.

Play nextBack to Security
9:36