CEH Enumeration and System Hacking Practice Question
Which password cracking method uses a precomputed table of hash chains to reverse password hashes quickly?
⚠ Common exam trap
A common mix-up: candidates confuse rainbow tables with dictionary attacks, thinking both use precomputed lists, but rainbow tables specifically use hash chains to cover many passwords efficiently, not a simple list of words.
Answer choices
Why each option matters
Answer the question above first, then reveal the full breakdown to understand why each option is right or wrong.
Correct answer & explanation
✓
Rainbow table attack
A rainbow table attack is correct because it uses precomputed tables of hash chains to reverse password hashes quickly. Instead of computing the hash for every possible password in real time, the attacker looks up the hash in the table to find the corresponding plaintext, drastically reducing the time needed for cracking.
Answer analysis
Option-by-option breakdown
For each option: why learners choose it and why it is or isn't the right answer here.
- ✗
Hybrid attack
Why it's wrong here
A hybrid attack combines elements of dictionary and brute-force methods. It typically starts with dictionary words and then systematically modifies them by appending or prepending numbers, special characters, or common patterns. This method still involves generating and hashing potential passwords on the fly, making it a computational process rather than a direct lookup from a precomputed table of hash-to-plaintext pairs.
- ✓
Rainbow table attack
Why this is correct
A rainbow table attack utilizes a precomputed table of hash chains to reverse cryptographic hash functions efficiently. Instead of brute-forcing each hash, the attacker looks up the target hash within the table, which maps hashes back to their original plaintext passwords. This method exploits a time-memory tradeoff, allowing for rapid password recovery without needing to compute every possible password combination during the attack.
- ✗
Dictionary attack
Why it's wrong here
A dictionary attack attempts to crack passwords by comparing the hash of a target password against the hashes of words found in a predefined list or dictionary. For each word in the dictionary, the attacker computes its hash and then compares it to the target hash. This process involves active hashing computation for every entry, rather than a direct lookup from a pre-generated table of hash-to-plaintext mappings.
- ✗
Brute-force attack
Why it's wrong here
A brute-force attack systematically tries every possible character combination within a defined character set and length until the correct password is found. This method involves generating each potential password, hashing it, and comparing the resulting hash to the target hash. It is a computationally intensive process that requires significant processing power and time, as it does not rely on any precomputed data structures for efficiency.
Go deeper
Related to this question
About these practice questions
Courseiva writes every CEH question from scratch — 870 in total, each with an explanation and a wrong-answer breakdown. None are copied from real exams or dumps. Learn why practice questions differ from exam dumps →
JA
Written by Johnson Ajibi, MSc IT Security
Senior Network & Security Engineer · founder of Courseiva
This CEH practice question is part of Courseiva's free EC-Council certification practice question bank. Courseiva provides original exam-style practice questions with explanations, topic-based practice, mock exams, readiness tracking, and study analytics to help learners prepare for the CEH exam.