312-50V10 Question #754: Real Exam Question with Answer & Explanation

The correct answer is D: Collision attacks try to find two inputs producing the same hash. A collision attack in cryptography is the attempt to find two distinct input values that produce the same hash digest, breaking the collision resistance property of a hash function.

Cryptography

Question

What is a "Collision attack" in cryptography?

Options

ACollision attacks try to get the public key
BCollision attacks try to break the hash into three parts to get the plaintext value
CCollision attacks try to break the hash into two parts, with the same bytes in each part to get the
DCollision attacks try to find two inputs producing the same hash

Explanation

A collision attack in cryptography is the attempt to find two distinct input values that produce the same hash digest, breaking the collision resistance property of a hash function.

Common mistakes.

A. Collision attacks target the output of hash functions, not public keys; attempting to derive a private key from a public key describes a different class of asymmetric cryptography attack.
B. Hash functions produce a single fixed-length digest and are not broken into three parts; this description does not correspond to any recognized cryptographic attack model.
C. This description inaccurately adds a constraint about matching bytes within hash segments; a collision attack only requires two different inputs yielding the same final hash output, with no requirement about the internal structure of the hash.

Concept tested. Cryptographic hash function collision attack definition

Reference. https://csrc.nist.gov/glossary/term/collision_attack

Topics

#collision attack#hash functions#cryptographic attacks#hash collision

Community Discussion

No community discussion yet for this question.

Full 312-50V10 Practice