ECDSA: Elliptic Curve Digital Signature Algorithm
You'll learn why ECDSA has become the modern standard for digital signatures, requiring smaller keys than RSA while maintaining strong security.
What Is ECDSA?
ECDSA is a digital signature algorithm built on elliptic curve cryptography. Like RSA signatures, it proves a message came from a specific sender and hasn't been tampered with—but it achieves this with dramatically smaller keys. A 256-bit ECDSA key provides security roughly equivalent to a 3072-bit RSA key.
How ECDSA Works
When signing a message, ECDSA combines three elements:
- Your private key (a secret number)
- The message hash (SHA-256 of your data)
- A random nonce (a one-time number called 'k')
The signature consists of two numbers (r, s) computed through elliptic curve math. Anyone with your public key can verify the signature matches the message, but only you could have created it.
The Critical Nonce Requirement
The nonce must be truly random and never reused. Think of it like a lottery ticket—if you use the same "winning number" twice with different messages, attackers can mathematically recover your entire private key. This happened to Sony's PlayStation 3 when they reused nonces, exposing their signing key.
Why ECDSA Dominates Modern Systems
- Smaller keys: 256-bit ECDSA vs 3072-bit RSA means faster transmission and less storage
- Mobile-friendly: Less computation power needed for equivalent security
- Widespread adoption: Used in Bitcoin, TLS certificates, SSH keys, and OAuth tokens
ECDSA trades some implementation complexity (careful nonce handling) for massive efficiency gains.
Key Takeaway: ECDSA delivers RSA-equivalent signature security with ~10× smaller keys, but demands perfect nonce randomness and uniqueness—reuse catastrophically breaks security.