How your course algorithms fit together
Intro theory (CIA, threat layers, Sec-SDLC) lives in Intro Playlist Concepts — this page is the algorithm map only.
DES (block, 64-bit chunks) and RC4 (stream, byte-by-byte) both use one shared secret key.
Problem: How do two people agree on the key over the internet?
RSA encrypts with public key, decrypts with private. Diffie-Hellman agrees on a shared secret without sending it.
Trade-off: Slower, but solves key distribution.
| Cipher (DES, RC4, RSA) | Hash (SHA-1) | |
|---|---|---|
| Reversible? | Yes — decrypt to get plaintext | No — cannot recover message |
| Needs key? | Yes (shared or public/private) | No key — deterministic function |
| Exam skill | Encrypt/decrypt traces | Padding + compression rounds |
| One-bit input change | Ciphertext changes (roughly half the bits) | Completely different hash (avalanche) |
DES waits until it has 64 bits, then transforms the whole block through 16 Feistel rounds. RC4 generates a keystream one byte at a time and XORs it with each plaintext byte — no fixed block size.
Which algorithm solves the key distribution problem without encrypting the message itself?
Which pair are both symmetric ciphers taught in your course?