GSEC Question #303: Real Exam Question with Answer & Explanation

The correct answer is D. Using a larger bit length for the algorithm. Hash collisions occur when two inputs produce the same hash output; using a larger bit length increases the output space exponentially, making collisions computationally infeasible.

Question

What could be used to mitigate hash collisions?

Options

AUsing a larger key space for the encryption
BUsing additional arbitrary data to append to the file
CUsing separate keys for encryption and decryption
DUsing a larger bit length for the algorithm

Explanation

Hash collisions occur when two inputs produce the same hash output; using a larger bit length increases the output space exponentially, making collisions computationally infeasible.

Common mistakes.

A. Key space size applies to symmetric or asymmetric encryption strength, not to hash function collision resistance, as hashing does not use encryption keys.
B. Appending arbitrary data to a file changes the input but does not address the fundamental mathematical property of the hash function that allows collisions; this describes salting for passwords, not collision mitigation.
C. Using separate keys for encryption and decryption describes asymmetric (public-key) cryptography and is unrelated to hash collision resistance.

Concept tested. Hash collision mitigation through increased bit length

Reference. https://csrc.nist.gov/projects/hash-functions

Community Discussion

No community discussion yet for this question.

Full GSEC Practice