Explore our new Cybersecurity Terms Glossary, explained by our experts.

View the Glossary View the Glossary
PRIVIA

Cybersecurity Terms Glossary

What Is Asymmetric Encryption?

Asymmetric encryption uses a mathematically linked key pair: a public key anyone may hold and a private key that never leaves its owner. It solves key distribution and makes digital signatures possible.

Illustration for the cybersecurity term Asymmetric Encryption
Home / Blog / Cybersecurity Terms / What Is Asymmetric Encryption?
17 November 2026

What Is Asymmetric Encryption?

What Is Asymmetric Encryption?

Two people who have never met need to exchange a secret over a network that everyone can read. Symmetric ciphers cannot help, because they assume a shared key already exists. Asymmetric encryption, also called public key cryptography, solves the problem with a pair of mathematically related keys: the public key may be printed on a billboard, while the private key never leaves the machine that generated it. Data encrypted with one can only be undone with the other.

Whitfield Diffie and Martin Hellman set out the idea in 1976, and Ron Rivest, Adi Shamir, and Leonard Adleman published the first practical construction, RSA, in 1977. British cryptographers at GCHQ had reached equivalent results several years earlier, but the work stayed classified until 1997.

The Mathematics in One Paragraph

Every scheme rests on a problem that is easy in one direction and hard in reverse. RSA multiplies two large primes; recovering them from the product is the integer factorisation problem. Diffie–Hellman and elliptic curve cryptography rely on the discrete logarithm problem: exponentiation is cheap, and reversing it is not. None of these problems is proven hard, which is why key sizes grow as computers and algorithms improve.

RSA and Elliptic Curves Compared

Security levelRSA modulusElliptic curveNotes
112 bits2048 bits224 bitsThe current public web minimum
128 bits3072 bits256 bitsP-256, X25519, Ed25519
192 bits7680 bits384 bitsP-384, used in high-assurance suites

The size difference is the reason the industry has largely moved to curves. An X25519 key exchange is faster than RSA-3072, uses a fraction of the bandwidth, and produces smaller certificates, which matters on constrained devices and on mobile networks. RSA survives because of inertia, hardware support, and the enormous installed base of code that knows how to parse it.

Nobody Encrypts Files with RSA

Public key operations are hundreds of times slower than AES, and RSA can only encrypt a payload smaller than its modulus. Real systems therefore use hybrid encryption: generate a random symmetric key, encrypt the data with AES, encrypt the symmetric key with the recipient’s public key, and send both. TLS 1.3 goes further and uses an ephemeral Diffie–Hellman exchange rather than RSA key transport, so that recording the traffic today and stealing the server key tomorrow does not reveal past sessions. That property is called forward secrecy.

Signatures Run the Same Machinery Backwards

Signing reverses the roles: the private key produces a value over a hash of the message, and anyone with the public key can verify it. That single mechanism underpins TLS server authentication, software update verification, email signing with S/MIME, SSH authentication, and the whole of certificate chain validation.

Where Implementations Break

The algorithms rarely fail; the padding and the plumbing do.

The Expiry Date on Public Key Cryptography

Shor’s algorithm breaks factorisation and discrete logarithms alike, so a cryptographically relevant quantum computer would retire RSA and elliptic curves together while leaving AES largely intact. NIST published the first replacement standards in August 2024, and the NCSC expects UK organisations to complete migration by 2035. Start with an inventory of where public key cryptography is used, because you cannot replace what you have not catalogued. Our infrastructure and architecture review services include that discovery work.

FAQ – Frequently Asked Questions

Which Key Encrypts and Which Key Decrypts?

It depends on the goal. For confidentiality the sender encrypts with the recipient’s public key, and only the recipient’s private key can decrypt. For authenticity the signer uses their own private key, and anyone can verify with the public key. The same key pair should not be reused for both purposes in a well-designed protocol.

Is RSA Obsolete?

Not yet, but it is in slow retirement. RSA-2048 remains acceptable for signatures and certificates today, and most browsers still accept it. New designs should prefer elliptic curves for speed and size, and every long-lived system should plan for post-quantum replacements. RSA-1024 is already unacceptable and should be removed wherever it is still in use.

Why Do TLS Connections Use Both Key Types?

Because each does one job well. An asymmetric exchange authenticates the server and establishes a shared secret over an untrusted network, which symmetric cryptography cannot do alone. The connection then switches to AES or ChaCha20 for the data, because symmetric ciphers handle gigabytes at a cost public key operations could never match.

How Long Should an Asymmetric Key Live?

Public TLS certificates are capped by the CA/Browser Forum and are heading towards 47 days by 2029, with automated reissuance. Internal signing keys often live for years, which makes their storage and rotation plan far more important. Any key that cannot be rotated quickly is a liability, so build the replacement path before you need it.

Related Terms

You May Be Interested In These

What Is an Access Review?

Cybersecurity Terms

17 November 2026

What Is an Access Review?

Read More
What Is x64dbg?

Cybersecurity Terms

17 November 2026

What Is x64dbg?

Read More