EC-Council Certified Encryption Specialist study plan
EC-Council Certified Encryption Specialist · Give each week a clear focus.
8 weeks · About 7 hours per week
Symmetric Cryptography & Hashes
Distinguish block vs. stream ciphers and map AES, DES/3DES, RC4, and ChaCha20 to their correct category
Trace each stage of AES-128 (SubBytes, ShiftRows, MixColumns, AddRoundKey, key expansion) and state the purpose of each
Explain why DES's 56-bit key and 64-bit block are insufficient today, and how 3DES and AES address that
Compare ECB, CBC, CTR, and GCM modes and identify which provide confidentiality only versus confidentiality plus integrity
Define the properties of a cryptographic hash (preimage resistance, second-preimage resistance, collision resistance) and the avalanche effect
Your checkpoint
A one-page comparison table of at least six symmetric algorithms and four block cipher modes, each with key size, block size, status, and one-line use case, self-quizzed to 90% recall
Symmetric Cryptography & Hashes & Introduction and History of Cryptography
Differentiate MD5, SHA-1, SHA-2 family, and SHA-3 and state which are deprecated and why
Explain how HMAC, PBKDF2, bcrypt, and scrypt differ from plain hashing and when each is appropriate
Describe the difference between keyed and unkeyed hashes and how MACs provide integrity and authenticity
Place historical ciphers (Caesar, Vigenere, Playfair, one-time pad) in the substitution/transposition taxonomy
State Shannon's principles of confusion and diffusion and identify which historical and modern designs implement each
Your checkpoint
A written 500-word analysis comparing password storage approaches (salted SHA-256 vs. bcrypt vs. Argon2) with a recommendation and justification
Number Theory and Asymmetric Cryptography
Perform modular arithmetic and modular exponentiation by hand on small numbers without a calculator
Explain the roles of prime numbers, coprime values, Euler's totient function, and Fermat's little theorem in RSA
Work through RSA key generation, encryption, and decryption with small primes and verify the round trip
Compare RSA, Diffie-Hellman, DSA, and ECC by key size, computational assumption, and typical use
Explain how Diffie-Hellman key exchange reaches a shared secret and why it is vulnerable to man-in-the-middle without authentication
Describe elliptic curve cryptography's advantage in key size per bit of security and name common curves in use
Your checkpoint
A worked problem set of ten number-theory and RSA exercises with full solutions, scored against a reference answer sheet at 80% or better
Number Theory and Asymmetric Cryptography & Applications of Cryptography
Distinguish symmetric from asymmetric key distribution problems and explain how hybrid encryption solves both
Describe the contents and trust model of an X.509 certificate and the role of a certificate authority and chain of trust
Trace a TLS 1.3 handshake and identify where key exchange, authentication, and record-layer encryption occur
Explain digital signatures, non-repudiation, and why signing a hash rather than a message matters
Compare PGP/GPG web-of-trust with PKI hierarchy models
Your checkpoint
A diagrammed walkthrough of a TLS 1.3 session from ClientHello to application data, annotated with the algorithm used at each step, explained aloud in under ten minutes
Applications of Cryptography
Apply the correct cryptographic primitive to scenarios: data at rest, data in motion, email, code signing, and VPNs
Explain IPsec (AH vs. ESP), SSH, S/MIME, and full-disk encryption at the level of which algorithms they use
Describe key management lifecycle: generation, distribution, storage, rotation, escrow, destruction
Identify common implementation failures such as reused IVs, hardcoded keys, weak random number generators, and padding oracle exposure
Differentiate steganography, obfuscation, and encoding from encryption
Your checkpoint
A scenario matrix of twelve exam-style use cases, each mapped to a recommended algorithm, mode, and key management approach with a one-sentence justification
Cryptanalysis
Classify attacks as ciphertext-only, known-plaintext, chosen-plaintext, or chosen-ciphertext and give an example of each
Explain brute force, dictionary, rainbow table, and birthday attacks and the specific countermeasure for each
Describe differential and linear cryptanalysis conceptually and why they drove AES design choices
Explain side-channel attacks (timing, power, fault) and the concept of a meet-in-the-middle attack on 2DES
Distinguish cryptanalysis from social engineering and implementation attacks such as BEAST, POODLE, and Heartbleed
Your checkpoint
A threat-model write-up of 600 words covering five attacks against a specified system, each with the attack class, prerequisite access, and mitigation
Quantum Computing and Cryptography & Introduction and History of Cryptography
Explain qubits, superposition, entanglement, and interference at a conceptual level sufficient to reason about algorithm speedups
Describe Shor's algorithm's impact on RSA, Diffie-Hellman, and ECC and Grover's algorithm's quadratic impact on symmetric keys
State post-quantum families (lattice, hash-based, code-based, multivariate) and name representative standardized algorithms
Apply the rule that symmetric key sizes must roughly double to resist Grover and explain harvest-now-decrypt-later risk
Revisit the history timeline from Caesar to post-quantum and connect each era's weakness to the next era's design
Your checkpoint
A two-page brief on post-quantum migration for a hypothetical organization, naming affected algorithms, replacement candidates, and a prioritized migration order
Introduction and History of Cryptography & Symmetric Cryptography & Hashes & Number Theory and Asymmetric Cryptography & Applications of Cryptography & Cryptanalysis & Quantum Computing and Cryptography
Retake a full-length timed practice exam and score 85% or higher overall and 70% or higher in every domain
Re-drill every missed item to its underlying concept rather than memorizing the answer
Recite from memory key sizes, block sizes, hash output lengths, and status for all major algorithms
Explain aloud the difference between confusion and diffusion, symmetric and asymmetric, and hashing and encryption without notes
Review personal weak-spot notes and confirm each item is resolved
Your checkpoint
A final scorecard showing per-domain percentages from two full practice exams with a written remediation note for every remaining gap
Milestones
Week 2: Score 80% or higher on a 30-question self-test covering symmetric algorithms, modes, and hashes, with no more than two missed items in the same subtopic
Week 4: Complete the RSA and Diffie-Hellman worked problems without reference material and explain the TLS 1.3 handshake unaided
Week 6: Correctly classify 20 given attack scenarios by attack type and name the matching countermeasure for at least 17
Week 8: Achieve 85% or higher on a full timed practice exam with every domain at or above 70%