Cybersecurity Foundations (Grades 6–8) · lesson 24 of 48 · 12 min
The Key Distribution Problem — Why Two Types of Encryption Exist
Imagine you want to send a secret message to a friend. You encrypt it with a key. But how do you securely share the key? If you send the key over the same insecure channel as the message, an attacker can intercept both. This is the key distribution problem — and it stumped cryptographers for centuries.
In 1976, Whitfield Diffie and Martin Hellman published a revolutionary solution: asymmetric encryption, also called public-key cryptography. It allows two parties to establish a shared secret over an insecure channel without ever having met. This breakthrough made secure internet communication possible.
By the end of this lesson you will be able to explain symmetric and asymmetric encryption, compare their strengths and weaknesses, explain how they work together in HTTPS, and describe digital signatures and certificate authorities.
Why this matters
Every time you visit an HTTPS site, your browser and the server perform an asymmetric key exchange in milliseconds, then switch to AES for the rest of the session. This is why HTTPS is both secure and fast. Without asymmetric encryption, secure internet commerce would be impossible.
Two Types of Encryption
There are two main types of encryption:
Symmetric encryption — uses the same key to encrypt and decrypt. Fast and efficient. The challenge: how do you securely share the key with the other person?
Analogy: a padlock where the same key locks and unlocks it. Both people need a copy of the key.
Asymmetric encryption (public-key cryptography) — uses two mathematically linked keys: a public key (shared with everyone) and a private key (kept secret). Data encrypted with the public key can only be decrypted with the private key.
Analogy: a mailbox. Anyone can drop a letter in (encrypt with public key). Only the owner with the key can open it (decrypt with private key).
How They Work Together
In practice, HTTPS and most secure protocols use both types:
- Asymmetric encryption is used to securely exchange a symmetric key (the “handshake”).
- Once both parties have the symmetric key, they switch to fast symmetric encryption for the actual data.
This is called a hybrid encryption scheme — it gets the security of asymmetric key exchange with the speed of symmetric encryption.
Digital signatures — asymmetric encryption also enables digital signatures. You encrypt a message with your private key. Anyone with your public key can verify it came from you (only you have the private key). Used for software signing, email (S/MIME), and document signing.
Certificate Authorities (CAs) — trusted organisations that issue digital certificates binding a public key to an identity. When you visit https://Tech Camp for Kids.com, your browser verifies the certificate was issued by a trusted CA.
Key Terms
Real-World Case Studies
Case 1: The Diffie-Hellman Revolution (1976)
Before Diffie-Hellman, secure communication required physically exchanging keys — couriers, diplomatic pouches, or face-to-face meetings. This made secure communication expensive and impractical for ordinary people. Diffie and Hellman’s 1976 paper “New Directions in Cryptography” introduced the concept of public-key cryptography. It was so revolutionary that the NSA tried to suppress its publication. Today, every secure website, every encrypted message, and every online payment uses the principles they introduced.
Case 2: RSA — The Algorithm That Secured the Internet
In 1977, Ron Rivest, Adi Shamir, and Leonard Adleman developed RSA — the first practical public-key encryption algorithm. RSA is based on the mathematical difficulty of factoring large numbers. A 2048-bit RSA key would take millions of years to crack with current computers. RSA is used in HTTPS, SSH, email encryption, and digital signatures. The three inventors received the Turing Award (the “Nobel Prize of computing”) in 2002. Their work made secure internet commerce possible.
Activity — Symmetric vs. Asymmetric Sorting
Symmetric or Asymmetric Encryption?
- Uses one shared key for both encryption and decryption
- sym
Symmetric encryption uses the same key to lock and unlock data. Both parties must have the same key.
- Uses a public key and a private key
- asym
Asymmetric encryption uses a key pair. The public key encrypts; the private key decrypts.
- AES-256 is the most common example
- sym
AES (Advanced Encryption Standard) is the most widely used symmetric algorithm.
- RSA and ECC are common examples
- asym
RSA and ECC are asymmetric algorithms used for key exchange and digital signatures.
- Much faster — used for encrypting large amounts of data
- sym
Symmetric encryption is computationally efficient, making it ideal for encrypting large files and data streams.
- Solves the key distribution problem — no need to share a secret in advance
- asym
Asymmetric encryption allows two parties to establish a shared secret over an insecure channel without prior contact.
Knowledge Check
Symmetric vs. Asymmetric Encryption
Symmetric encryption uses:
- Two different keys
- One shared key for both encryption and decryption
- A public and private key
- No key
- Answer: One shared key for both encryption and decryption
Symmetric encryption uses the same key to lock and unlock data. AES is the most common symmetric algorithm. The main challenge with symmetric encryption is:
- It is too slow
- Securely sharing the key with the other party
- It uses too much memory
- It cannot encrypt large files
- Answer: Securely sharing the key with the other party
If you need to share the key, how do you do it securely? This is the “key distribution problem” that asymmetric encryption solves. In asymmetric encryption, data encrypted with the public key can only be decrypted by:
- Anyone with the public key
- The private key
- A certificate authority
- The same public key
- Answer: The private key
Public key encrypts, private key decrypts. The private key never leaves the owner — only they can decrypt messages sent to them. HTTPS uses both symmetric and asymmetric encryption because:
- It is required by law
- Asymmetric handles key exchange; symmetric handles fast data encryption
- Symmetric is more secure
- Asymmetric cannot encrypt data
- Answer: Asymmetric handles key exchange; symmetric handles fast data encryption
Hybrid encryption: asymmetric securely exchanges a symmetric key, then fast symmetric encryption handles the actual data. A digital signature uses your private key to:
- Encrypt messages to others
- Prove a message came from you
- Share your public key
- Decrypt received messages
- Answer: Prove a message came from you
Signing with your private key proves authenticity — only you have the private key, so only you could have created that signature.
RSA and ECC are examples of which type of encryption?
- Symmetric
- Asymmetric
- Hashing
- Compression
Answer: Asymmetric
RSA and ECC (Elliptic Curve Cryptography) are asymmetric algorithms using public/private key pairs. AES is symmetric.
Previous lesson: What is encryption?
Back to Cybersecurity Foundations (Grades 6–8)
Next lesson: HTTPS and TLS