Efficient Offline NTLM Hash Cracking: Hashcat and John the Ripper
A penetration tester obtains password hashes from a Windows system. Which TWO methods would be most efficient for cracking NTLM hashes offline? (Choose two.)
Quick Answer
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.
⚠ Common exam trap
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.
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
✓
Using Hashcat with a brute-force attack on GPU
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.
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.
- ✓
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.
Go deeper
Related to this question
About these practice questions
This CEH question is part of Courseiva's 870-question bank — original exam-style content with full explanations and wrong-answer analysis, never real exam questions or exam dumps. Learn why practice questions differ from exam dumps →
Same concept, more angles
1 more way this is tested on CEH
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.
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.