Asymmetric encryption uses a PAIR of mathematically-related keys per party:
- Public key: shared openly with anyone.
- Private key: kept secret by the owner.
The relationship between the keys is one-way: data encrypted with the public key can ONLY be decrypted with the corresponding private key, and vice versa. Knowing the public key doesn't reveal the private key (it would take billions of years even with the most powerful computers).
Encrypting a message TO someone:
- Sender obtains the recipient's PUBLIC key (openly available).
- Sender encrypts with the recipient's public key → ciphertext.
- Sender transmits.
- Recipient decrypts with their own PRIVATE key.
Even if the ciphertext AND the public key are intercepted, the message is unreadable. Only the private-key holder can decrypt.
Digital signatures (the reverse direction):
- Sender encrypts (a hash of) the message with their OWN PRIVATE key → signature.
- Anyone can decrypt the signature using the sender's public key.
- If the decrypted hash matches the message hash, the signature is valid → confirms WHO sent the message and that it wasn't modified.
Examples of asymmetric algorithms:
- RSA — the original and still widely used.
- ECC (Elliptic Curve Cryptography) — smaller keys, equivalent security.
Strengths:
- No key-distribution problem. Public keys can be shared freely.
- Enables digital signatures and authentication.
Weaknesses:
- Slow. Computationally expensive — orders of magnitude slower than symmetric.
- Only practical for small amounts of data.
Cambridge tip. Top-band candidates remember: encrypt with RECIPIENT'S public key; decrypt with YOUR OWN private key. Reverse for signatures (sign with YOUR OWN private; verify with sender's public).