Explore our new Cybersecurity Terms Glossary, explained by our experts.
Cybersecurity Terms Glossary
Elliptic curve cryptography achieves the same security as RSA with far smaller keys by working with points on a curve. A 256-bit curve key matches a 3072-bit RSA key.

What Is Elliptic Curve Cryptography?
Elliptic curve cryptography builds public key operations on the arithmetic of points on a curve defined over a finite field. The underlying hard problem is the elliptic curve discrete logarithm: given a base point G and a point Q = kG, recover the integer k. Computing Q from k is cheap; going back is not, and no subexponential algorithm is known for well-chosen curves.
That last clause is the whole reason ECC matters commercially. Because the best known attacks are so much worse than those against factoring, curve keys can be dramatically smaller for the same strength.
| Security level | Elliptic curve | RSA / finite-field DH |
|---|---|---|
| 112 bits | 224 bits | 2048 bits |
| 128 bits | 256 bits | 3072 bits |
| 192 bits | 384 bits | 7680 bits |
| 256 bits | 512 bits | 15360 bits |
Smaller keys mean smaller certificates, smaller signatures, shorter handshakes, and far less computation. On a mobile network, an ECDSA certificate chain saves real milliseconds per connection; on a battery-powered sensor, the difference between a 256-bit scalar multiplication and a 3072-bit modular exponentiation decides whether public key cryptography is feasible at all. Neal Koblitz and Victor Miller proposed the idea independently in 1985, but it took until the 2010s for deployment to catch up.
Avoid curves below 224 bits, binary-field curves that have attracted recent cryptanalysis, and anything custom. Curve choice is one of the few cryptographic decisions where following the crowd is correct.
Three constructions cover almost all deployment. ECDH, usually ephemeral as ECDHE, performs the key exchange in TLS, SSH, Signal, and WireGuard. ECDSA and EdDSA produce digital signatures for certificates, software, and tokens. ECIES combines an ephemeral exchange with symmetric encryption when a message must be encrypted to a public key directly.
Note that ECC is never used to encrypt bulk data. As with RSA, it establishes or protects a symmetric key, and AES or ChaCha20 does the work.
The curve arithmetic is unforgiving of shortcuts.
Shor’s algorithm solves the elliptic curve discrete logarithm problem, and it does so with fewer logical qubits than breaking an equivalent RSA key would require — the small key sizes that make ECC efficient also make it a slightly easier quantum target. Every curve-based key exchange and signature therefore needs a replacement path.
The transitional answer is hybrid key exchange, combining X25519 with ML-KEM so that an attacker must break both. Chrome and Cloudflare began large-scale deployment in 2024, and NCSC guidance expects UK organisations to be well into migration by 2031. For signatures the change is harder, because ML-DSA signatures are an order of magnitude larger and every protocol that assumed 64-byte signatures has to be revisited. Reviewing where curve cryptography is embedded in your products is part of the discovery work in our cyber risk analysis services.
At equivalent published security levels they are comparable; the difference is efficiency. A 256-bit curve key matches a 3072-bit RSA key while being far faster and smaller. ECC is also more sensitive to implementation errors, so a well-reviewed library matters more than the choice between the two algorithm families.
Use X25519 and Ed25519 where both ends support them, because they are harder to implement incorrectly and avoid the nonce pitfalls of ECDSA. Use P-256 or P-384 where compliance frameworks, hardware tokens, or legacy clients require them. Both are acceptable today; what matters is avoiding obscure curves and short key lengths.
Because wallets sign frequently with the same key, and ECDSA requires a unique, unbiased nonce for every signature. Faulty random number generation on constrained devices has produced repeated or biased nonces, and lattice techniques recover the private key from a handful of signatures. Deterministic signing under RFC 6979 or Ed25519 prevents this.
You can start. ML-DSA is standardised as FIPS 204 and implementations exist in OpenSSL 3.5, Go, and the major cloud key management services. The obstacles are size and interoperability: signatures and public keys are much larger, and certificate chains, embedded devices, and protocols with fixed field sizes all need testing before a production switch.
You May Be Interested In These
We use a few cookies that are needed to make this website work, and they are always on. We would also like to set analytics cookies, to see which pages are useful; functional cookies, so that our live chat works; and advertising cookies, to measure our campaigns. We will not set any of those until you say yes, and you can change your mind at any time from the Cookie Settings link in the footer.
Choose the cookies you are happy for us to use. Strictly necessary cookies are always on; everything else is off until you turn it on.
These cookies keep the website working: they hold your security checks, your form submissions and the choice you make here. The site cannot run without them, so they are always on.
These let our live chat open and remember your conversation, and let the newsletter sign-up work. Switch them off and the chat window will not appear.
These tell us which pages are read and how people find us, so that we can improve the site. The reports are about groups of visitors, never about you personally.
These let us measure our advertising and show you our adverts on other websites, such as LinkedIn, Google and Meta. Switch them off and you will still see adverts, but they will be less relevant.