CISSP Domain 3: Cryptanalysis & Attack Vectors — Mindmap Review Study Guide
PART 1: MERMAID MINDMAP
mindmap
root((Cryptanalysis))
Cryptanalysis Overview
Definition and Goals
Cryptanalytic vs Cryptographic
Cryptanalytic Attacks
Goal Deduce Key
Brute Force
Ciphertext Only
Known Plaintext
Chosen Plaintext
Chosen Ciphertext
Linear Differential Analysis
Factoring RSA
Cryptographic Attacks
Man in the Middle
Replay
Pass the Hash
Temporary Files
Implementation Attacks WEP
Side Channel
Power
Timing
Radiation Emissions
Dictionary Attack
Rainbow Tables
Birthday Attack
Social Engineering
Purchase Key
Rubber Hose
═══════════════════════════════════
PART 2: TECHNICAL DEFINITIONS & CONCEPTS
Cryptanalysis Overview
Cryptanalysis — The art and science of understanding how cryptosystems work to find ways to defeat or strengthen them. It is the process of decoding secrets, gaining access to encrypted messages, and forging new messages.
Cryptanalytic Attacks vs. Cryptographic Attacks
| Attack Type | Primary Focus |
|---|---|
| Cryptanalytic Attacks | Solely focused on deducing the encryption key. |
| Cryptographic Attacks | Not solely focused on deducing the key. |
Cryptanalytic Attacks
Primary Goal of Cryptanalytic Attacks — The primary goal of all cryptanalytic attacks is to deduce the key (find the crypto variable used to decrypt the ciphertext).
- ⚠️ EXAM TIP: Memorize that the primary goal of cryptanalytic attacks is to deduce the key.
Brute Force vs. Dictionary Attack
| Attack Type | Methodology | Efficiency |
|---|---|---|
| Brute Force | Tries every possible key until the right one is found. | Ineffective for long keys; the key space grows exponentially (doubles per bit), making 128-bit or 256-bit keys insurmountable. |
| Dictionary Attack | A form of brute force that tries the most likely combinations first using giant datasets of common passwords. | Much more efficient and faster than a simple sequential brute force attack. |
Ciphertext Only vs. Known Plaintext
| Attack Type | Attacker Access | Difficulty / Goal |
|---|---|---|
| Ciphertext Only | Only the ciphertext. | Very difficult; attacker must deduce the key from ciphertext alone. |
| Known Plaintext | Both the ciphertext and the associated plaintext. | Attacker uses both to deduce the key, then decrypts other messages and forges new ones. |
Chosen Plaintext vs. Chosen Ciphertext Note: In both “chosen” attacks, the attacker has access to the machine or algorithm performing the encryption/decryption.
| Attack Type | Attacker Action | Attacker Observation |
|---|---|---|
| Chosen Plaintext | Chooses what plaintext to feed into the encryption machine/algorithm. | Looks at the resultant ciphertext to deduce the key. |
| Chosen Ciphertext | Chooses what ciphertext to feed into the decryption machine/algorithm. | Looks at the resultant plaintext to deduce the key. |
Linear & Differential Analysis — A type of cryptanalytic attack (mentioned in the transcript, but no further definition provided).
Factoring Attack — A cryptanalytic attack associated with asymmetric algorithms that use factoring as the hard math problem.
- ⚠️ EXAM TIP: If you see a factoring attack, think RSA; if you want to attack RSA, think of the factoring attack.
Cryptographic Attacks
Man-in-the-Middle (MitM) — An attack where the attacker places themselves in the middle of a conversation to eavesdrop on communications, and potentially alter or decipher them.
Replay Attack — A form of MitM attack where the attacker intercepts data (such as a hashed password sent for authentication) and re-sends (replays) it later to masquerade as the user and gain unauthorized access, without necessarily deciphering the intercepted data.
Pass the Hash — A specific type of replay attack where the attacker captures a hashed password and re-sends it later to authenticate as the user.
- Hierarchy to remember: Pass the Hash is a type of Replay attack, and a Replay attack is a type of Man-in-the-Middle attack.
Temporary Files Attack — Cryptosystems often use temporary files to store plaintext, ciphertext, and encryption keys during encryption/decryption. If these files are not sufficiently secured, an attacker can access them to steal sensitive plaintext or encryption keys.
Implementation Attacks — Target weaknesses in how an algorithm, cryptosystem, protocol, or application is implemented, rather than the algorithm itself.
- ⚠️ EXAM TIP: A perfect example to remember for the exam is WEP (Wired Equivalency Protocol). WEP implements the excellent RC4 algorithm but is horribly insecure due to short and partially static initialization vectors.
Side Channel Attacks — Attacks where sensitive information is gathered by carefully monitoring a system while it performs cryptographic tasks.
| Attack Type | Measurement/Monitoring Focus |
|---|---|
| Power | Measures how much power is consumed by certain calculations. |
| Timing | Measures how long certain cryptographic operations take to complete. |
| Radiation Emissions | Closely monitors the electromagnetic waves emanated by a system. |
Rainbow Tables — An extension of password dictionaries consisting of a giant database of the most common passwords and their pre-computed hash values. This allows attackers to quickly match a stolen password hash to a plaintext password.
- Defeat Method: Use Salt & Pepper to defeat rainbow tables.
Birthday Attack — Exploits the mathematics behind the birthday paradox in probability theory.
- ⚠️ EXAM TIP: Associate birthday attacks with finding collisions in hashing algorithms.
Social Engineering
Social Engineering — Attacking a cryptosystem by targeting the weakest link in any system: people.
| Attack Name | Approach | Description |
|---|---|---|
| Purchase Key | Carrot | Bribing someone to obtain a super secure key. |
| Rubber Hose | Stick | Torturing someone to obtain a super secure key (Rubber hose cryptanalysis). |