CDPSE Privacy Engineering Practice Question
When pseudonymizing a database using SHA-256 hashing, what is the most critical requirement to prevent re-identification via brute-force or dictionary attacks?
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 a strong, unique salt
Adding a unique, secret salt to each input before hashing prevents the use of precomputed rainbow tables to reverse the hash.
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 a strong, unique salt
Why this is correct
A salt ensures that identical inputs result in different hashes, mitigating rainbow table attacks.
- ✗
Encrypting the hashing algorithm
Why it's wrong here
The algorithm itself does not need encryption; the integrity of the salt is what matters.
- ✗
Reducing the input entropy
Why it's wrong here
Reducing entropy makes brute-forcing easier, not harder.
- ✗
Truncating the output hash
Why it's wrong here
Truncation reduces the collision resistance and does not prevent dictionary attacks.
About these practice questions
This CDPSE question is part of Courseiva's 215-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 →
JA
Written and reviewed by Johnson Ajibi, MSc IT Security
Senior Network & Security Engineer · founder of Courseiva
Last reviewed August 2026 · checked against the official ISACA exam blueprint
This CDPSE practice question is part of Courseiva's free ISACA 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 CDPSE exam.