LearnBitcoin

Glossary

Elliptic Curve

A type of curve used in Bitcoin's cryptography (secp256k1) for generating public/private key pairs.

Bitcoin's public-key cryptography is built on a specific elliptic curve called secp256k1. Satoshi picked it for the original Bitcoin design and it's been the backbone of every Bitcoin signature ever since.

The relevant property: elliptic curves let you do "one-way math." You can multiply a known curve point G by a secret number k to get another point P (cheap). Going the other way - given P, finding k - is computationally infeasible for any realistic adversary. This asymmetry is the elliptic curve discrete logarithm problem, and Bitcoin's entire ownership model rests on it staying hard.

In practice:

  • Your private key is just a number k between 1 and roughly 2^256.
  • Your public key is the point P = k*G on the secp256k1 curve.
  • Signing a transaction proves you know k without revealing it, by exploiting the same one-way math.

Different elliptic curves exist (ed25519, NIST P-256, others). Bitcoin sticks with secp256k1 for compatibility and because no serious vulnerability has been found in it since Bitcoin launched on it in 2009, even as Bitcoin's growth made it one of the most-attacked cryptographic targets on Earth.

The most plausible threat is a sufficiently powerful quantum computer running Shor's algorithm, which could in principle break elliptic curve discrete log. This is a real concern but not imminent. Address types that keep the public key hashed until the coins are spent, such as P2WPKH, buy some defense-in-depth against that future. Taproot addresses do not, since each one holds the tweaked public key itself, with no hash in front.

See Post-Quantum Bitcoin for the migration framework, and the Key Space rabbit hole for why 2^256 is so much bigger than your intuition wants it to be.

Key takeaways

  • Foundational math for Bitcoin's public/private key system
  • Used for ECDSA and now Schnorr signatures on secp256k1
  • Security relies on intractability of discrete log problems

Corrected

  • Was: The entry listed Taproot, along with P2WPKH, as an address type that keeps the public key hidden until the coins are spent, which gives some protection against a future quantum computer. A caveat added in June 2026 still called Taproot only a partial exception.

    Now: Taproot gives none of that protection, because a Taproot address holds the tweaked public key itself, with no hash in front. The entry now gives P2WPKH as the example of a type that keeps the key hashed until the coins are spent. Details

Sources (1)

External references (2)

Related terms (9)

Published . Revised . One correction logged for this page.

Edit this page on GitHub