The most widely used digital signature: proof that a message came from the owner of a key.
The idea: Your private key is a number x and your public key is x·G. To sign, you pick a fresh random number k, compute the point k·G, and combine k, x and the message hash into a number s. Checking needs only the public key: the verifier recombines the hash, s and the public key and must land on the same point. Because k and x are tied together in one simple equation, anyone who learns k, or sees it reused for two messages, can solve for x: the famous nonce weakness.
Why it matters: Signs website certificates, passkeys, and every Bitcoin and Ethereum transaction.
On the map: certificates, passkeys / FIDO2
The elliptic-curve version of DSA and the most widely deployed signature[1]: TLS certificates (P-256), passkeys and FIDO2 security keys, Bitcoin and Ethereum transactions (secp256k1).
Its security proofs need idealized models (the generic group model, GGM)[2] and a collision-resistant hash (CRH). It is notoriously fragile with randomness: a reused or slightly biased nonce reveals the private key (PlayStation 3 in 2010[3], Android Bitcoin wallets in 2013[4]). Deterministic nonces (RFC 6979)[5] remove that risk.
If any of these breaks, this breaks too.
If this breaks, these break with it.