The four pillars of CISSP cryptography — explained with diagrams, a 10-question scenario quiz, and a decision tool to identify the right approach in any exam question.
🧪 Take the 10-Question Quiz →Every CISSP cryptography question maps to one of these four categories. Learn to recognize the signals.
Select a model to see diagrams, algorithm tables, and key CISSP concepts.
How the cipher processes data blocks — critical for CISSP exam questions.
| Mode | Parallelizable? | Uses IV? | CISSP Verdict |
|---|---|---|---|
| ECB — Electronic Codebook | ✅ Yes | ❌ No | ❌ Insecure — identical blocks = identical ciphertext; patterns leak |
| CBC — Cipher Block Chaining | ❌ No | ✅ Yes | ⚠️ Common — XORs each block with previous; vulnerable to padding oracle |
| CTR — Counter Mode | ✅ Yes | ✅ Yes | ✅ Secure — turns block cipher into stream cipher; fast & parallelizable |
| GCM — Galois/Counter Mode | ✅ Yes | ✅ Yes | ✅ Best — CTR + authentication tag (AEAD); used in TLS 1.3 |
| Algorithm | Type | Key Size | Block Size | Status |
|---|---|---|---|---|
| AES (Rijndael) | Block | 128/192/256-bit | 128-bit | ✅ Secure — NIST standard since 2001 |
| 3DES / TDEA | Block | 112/168-bit | 64-bit | ⚠️ Deprecated — NIST retired 2023; legacy systems only |
| DES | Block | 56-bit | 64-bit | ❌ Broken — brute-forceable in hours |
| Blowfish | Block | 32–448-bit | 64-bit | ⚠️ Aging — 64-bit block susceptible to birthday attacks |
| ChaCha20 | Stream | 256-bit | N/A | ✅ Secure — TLS 1.3; fast on mobile/embedded |
| RC4 | Stream | 40–2048-bit | N/A | ❌ Broken — WEP attack; never use |
| Algorithm | Use Case | Key Size | Security Basis | Notes |
|---|---|---|---|---|
| RSA | Encrypt + Sign | 2048–4096-bit | Integer factorization | ✅ Secure — 2048-bit minimum; slow |
| ECC | Encrypt + Sign | 256–521-bit | Elliptic curve discrete log | ✅ Secure — 256-bit ECC ≈ 3072-bit RSA strength; faster |
| DH / DHE | Key Exchange ONLY | 2048-bit+ | Discrete logarithm | ✅ Secure — cannot encrypt; DHE adds forward secrecy |
| ECDH / ECDHE | Key Exchange ONLY | 256-bit+ | Elliptic curve DL | ✅ Secure — ECC variant; ECDHE = ephemeral, forward secrecy |
| DSA | Signing ONLY | 1024–3072-bit | Discrete logarithm | ⚠️ Older — FIPS 186 standard; cannot encrypt |
| ECDSA | Signing ONLY | 256–521-bit | Elliptic curve DL | ✅ Secure — used in Bitcoin, TLS certificates |
| Algorithm | Output Size | Status | Key CISSP Note |
|---|---|---|---|
| SHA-256 (SHA-2 family) | 256-bit | ✅ Secure | NIST standard; default choice for most uses |
| SHA-512 (SHA-2 family) | 512-bit | ✅ Secure | Stronger; used in code signing, certificates |
| SHA-3 / Keccak | 224–512-bit | ✅ Secure | Completely different design from SHA-2; sponge construction |
| SHA-1 | 160-bit | ❌ Broken | Practical collision found 2017 (SHAttered). Avoid for integrity. |
| MD5 | 128-bit | ❌ Broken | Collisions trivially generated; only safe for non-security checksums |
| HMAC-SHA256 | 256-bit | ✅ Secure | Hash + secret key → integrity AND authentication (no non-repudiation) |
| bcrypt / scrypt / Argon2 | Variable | ✅ Secure | Key stretching for password storage; intentionally slow to resist brute force |
All four cryptographic approaches across every CISSP-relevant dimension.
| Criteria | 🔴 Symmetric | 🔵 Asymmetric | 🟢 Hashing | 🟣 PKI / Dig. Sig. |
|---|---|---|---|---|
| Key TypeBasics | Single shared secret key | Public + Private key pair | No key (hash function only) | Key pair + X.509 certificate |
| SpeedBasics | ⚡ Very fast (hardware-optimized) | 🐢 Slow (1,000× slower than symmetric) | ⚡ Very fast | 🔶 Mixed (hash=fast, sign=slow) |
| Key DistributionBasics | ❌ Hard — must share key securely | ✅ Easy — public key is public | ✅ None needed | ✅ Managed by PKI / CA |
| Typical Key/Output SizeBasics | 128–256-bit (AES) | 2048–4096-bit RSA; 256-bit ECC | 128-bit (MD5) to 512-bit (SHA-512) | 2048-bit RSA or 256-bit ECDSA |
| Infrastructure RequiredBasics | None (just share the key) | Minimal (generate key pair) | None | Full PKI: CA, CRL/OCSP, cert mgmt |
| Provides Confidentiality?Security Properties | ✅ Yes — encrypts data | ✅ Yes — encrypt with public key | ❌ No — hashing ≠ encryption | ❌ Signing only; add encryption separately |
| Provides Integrity?Security Properties | ❌ No (alone) — use with HMAC/GCM | ❌ No (alone) | ✅ Yes — detects tampering | ✅ Yes — hash in the signature |
| Provides Authentication?Security Properties | ❌ No — both sides share same key | ✅ Yes — public key ties to identity | ❌ No (use HMAC for this) | ✅ Yes — verified against certificate |
| Non-Repudiation?Security Properties | ❌ No | ❌ No (alone) — need PKI context | ❌ No | ✅ Yes — only you have your private key |
| Primary Use CasesUse Cases | Disk encryption, file encryption, database encryption, VPN tunnels (data phase) | TLS key exchange, email encryption (PGP/S-MIME), SSH authentication | Password storage, file integrity checks, digital signatures (the hash part) | HTTPS certificates, code signing, email signing, document signing |
| Common AlgorithmsUse Cases | AES-256, AES-128, 3DES (legacy), ChaCha20 | RSA, ECC, ECDSA, Diffie-Hellman, ECDH | SHA-256, SHA-3, SHA-512, HMAC-SHA256, bcrypt | RSA-SHA256, ECDSA, X.509 (format) |
| Primary Attack TypesAttacks | Brute force (short key), meet-in-the-middle (2DES), birthday attack (64-bit block) | Integer factorization (RSA), discrete log, small key, quantum threat (Shor's algorithm) | Collision attack, preimage attack, rainbow table (unsalted passwords), length extension | CA compromise, cert forgery, MITM (if no cert validation), revocation gap |
| Quantum Computing ThreatAttacks | 🟡 Moderate — double key length needed (AES-256 adequate) | 🔴 Severe — Shor's algorithm breaks RSA/ECC; post-quantum replacements needed | 🟡 Moderate — Grover's algorithm halves effective strength | 🔴 Severe — relies on asymmetric; same threat as asymmetric |
Six real-world scenarios that map directly to CISSP exam questions.
Each question is a scenario-based item modeled on real CISSP exam format. No memorization — you need to reason from the scenario.
Answer 3 questions to identify the right cryptographic primitive for any CISSP scenario.
Click each card to flip and reveal the mnemonic. Built for rapid recall under exam pressure.
If the question says… → Think this → Use this
| If the question says… | Think… | Answer |
|---|---|---|
| "fast" / "bulk data" / "disk encryption" / "large files" / "at rest" / "both have the key" | 🔴 Speed + volume. Same key both ways. | Symmetric (AES) |
| "no prior shared key" / "key exchange" / "public key" / "no pre-shared secret" / "DH" / "RSA" | 🔵 No prior relationship. Solve key distribution. | Asymmetric |
| "integrity" / "detect tampering" / "checksum" / "password storage" / "fingerprint" / "one-way" | 🟢 One-way. No key. Did it change? | Hashing (SHA-256) |
| "non-repudiation" / "prove sender" / "cannot deny" / "code signing" / "certificate" / "digital signature" | 🟣 Identity proof. Hash + private key. | Digital Signature / PKI |
| "integrity AND authentication" / "HMAC" | 🟢+🔑 Hash with a shared secret key. | HMAC (no NR) |
| "Perfect Forward Secrecy" / "ephemeral" / "past sessions safe if key compromised" | 🔵 Ephemeral DH. New key per session. | DHE / ECDHE |