The answer is using Hashcat with GPU acceleration and John the Ripper with a dictionary and rules. These two methods are the most efficient for offline NTLM hash cracking because they exploit the inherent weakness of the NTLM hash algorithm, which lacks salting and uses a single-round MD4 derivation, making it highly susceptible to parallelized attacks. Hashcat leverages GPU hardware to perform billions of hash calculations per second, ideal for brute-force or mask attacks when passwords are complex, while John the Ripper excels at applying rule-based mangling to dictionary words, efficiently cracking common or mutated passwords. On the CEH exam, this question tests your understanding of post-exploitation hash dumping and offline cracking strategies; a common trap is choosing online brute-force tools like Hydra, which are noisy and impractical for local hashes. Remember the mnemonic “GPU for speed, rules for need” — Hashcat’s GPU handles raw speed, while John’s rules handle pattern-based guesses.
CEH Enumeration and System Hacking Practice Question
This CEH practice question tests your understanding of enumeration and system hacking. Read the scenario carefully and evaluate each option against the stated constraints before committing to an answer. After answering, compare your reasoning against the explanation and wrong-answer breakdown below. Once you have made your selection, read the full explanation to reinforce the concept and understand why each distractor is designed to mislead on exam day.
A penetration tester obtains password hashes from a Windows system. Which TWO methods would be most efficient for cracking NTLM hashes offline? (Choose two.)
Answer the question above first, then reveal the full breakdown to understand why each option is right or wrong.
Correct answer & explanation
✓
Using Hashcat with a brute-force attack on GPU
Option D is correct because Hashcat, when used with a GPU, can perform massively parallel brute-force attacks against NTLM hashes, achieving billions of hash calculations per second. This makes it one of the most efficient tools for offline password cracking of NTLM hashes, especially when the password is not in a dictionary.
Key principle: Answer the scenario, not the keyword: identify the specific constraint before choosing the most familiar-sounding option.
Answer analysis
Option-by-option breakdown
For each option: why learners choose it and why it is or isn't the right answer here.
✗
Using RainbowCrack with precomputed rainbow tables for NTLM
Why it's wrong here
Rainbow tables for NTLM are huge and often impractical; brute-force/dictionary are preferred.
✗
Performing an online brute-force against the SAM database
Why it's wrong here
Online attacks are against a live system, not offline against hashes.
✗
Using Ophcrack with rainbow tables for NTLM
Why it's wrong here
Ophcrack is primarily for LM hashes, not NTLM (though can do both, but rainbow tables for NTLM are large and less effective).
✓
Using Hashcat with a brute-force attack on GPU
Why this is correct
Hashcat leverages GPU for high-speed cracking of NTLM hashes.
Related concept
Read the scenario before looking for a memorised answer.
✓
Using John the Ripper with a dictionary and rules
Why this is correct
John the Ripper with wordlist and mangling rules can crack many NTLM hashes.
Related concept
Read the scenario before looking for a memorised answer.
Common exam traps
Common exam trap: answer the scenario, not the keyword
EC-Council often tests the distinction between tools optimized for LM vs. NTLM hashes, and candidates mistakenly choose Ophcrack (option C) because they confuse its LM rainbow table capability with NTLM support.
Detailed technical explanation
How to think about this question
NTLM hashes are unsalted MD4 digests of the Unicode password, making them vulnerable to precomputation attacks, but GPU-based tools like Hashcat leverage OpenCL or CUDA to parallelize the attack across thousands of cores. In real-world engagements, a hybrid approach using dictionary attacks with rules (option E) combined with brute-force for remaining characters is often the most effective strategy, as pure brute-force can be time-prohibitive for long passwords.
KKey Concepts to Remember
Read the scenario before looking for a memorised answer.
Find the constraint that changes the correct option.
Eliminate answers that are true in general but not in this case.
TExam Day Tips
→Watch for words such as best, first, most likely and least administrative effort.
→Review why wrong options are wrong, not only why the correct option is correct.
Key takeaway
Answer the scenario, not the keyword: identify the specific constraint before choosing the most familiar-sounding option.
Real-world example
How this comes up in practice
A practitioner preparing for the CEH exam encounters this exact type of scenario on the job. The correct answer here is not the most general option — it is the best answer for the specific constraint described. Answer the scenario, not the keyword: identify the specific constraint before choosing the most familiar-sounding option. Real exam questions reward reading the full scenario before eliminating options, because the constraint defines which answer fits.
Related glossary terms
Concepts from this question explained
These glossary pages explain the core terms tested in this CEH question in full detail.
Enumeration and System Hacking — This question tests Enumeration and System Hacking — Read the scenario before looking for a memorised answer..
What is the correct answer to this question?
The correct answer is: Using Hashcat with a brute-force attack on GPU — Option D is correct because Hashcat, when used with a GPU, can perform massively parallel brute-force attacks against NTLM hashes, achieving billions of hash calculations per second. This makes it one of the most efficient tools for offline password cracking of NTLM hashes, especially when the password is not in a dictionary.
What should I do if I get this CEH question wrong?
Identify which exam domain this question belongs to, review the core concept, then practise similar questions from the same domain.
What is the key concept behind this question?
Read the scenario before looking for a memorised answer.
About these practice questions
Courseiva creates original exam-style practice questions with explanations and wrong-answer analysis. It does not publish real exam questions, exam dumps, or protected exam content. Learn why practice questions differ from exam dumps →
These questions test the same concept from different angles. Work through them to make sure you can recognise it however the exam phrases it.
Variation 1. A penetration tester obtains a list of password hashes and uses RainbowCrack. Which statement BEST describes how RainbowCrack works?
medium
A.It uses a dictionary attack with word mangling rules
B.It uses online password guessing against the target service
C.It uses a brute-force attack by trying all possible character combinations
✓ D.It uses time-memory trade-off with precomputed hash chains
Why D: RainbowCrack implements a time-memory trade-off attack by precomputing hash chains for a given set of passwords and storing them in rainbow tables. When a password hash is provided, the tool looks up the hash in these tables to reverse it, avoiding the need to recompute hashes for every possible password. This makes it far faster than brute-force for cracking hashes, provided the password is covered by the precomputed chains.
Last reviewed: Jun 30, 2026
Question Discussion
Share a tip, memory trick, or ask about the reasoning behind this question. Do not post real exam questions, leaked content, braindumps, or copyrighted exam material. Comments are moderated and may be removed without notice.
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.
Question Discussion
Share a tip, memory trick, or ask about the reasoning behind this question. Do not post real exam questions, leaked content, braindumps, or copyrighted exam material. Comments are moderated and may be removed without notice.
Sign in to join the discussion.