312-50V13 · Question #61
What is a "Collision attack" in cryptography?
The correct answer is D. Collision attacks try to find two inputs producing the same hash. A collision attack in cryptography seeks to find two distinct inputs that produce the exact same hash output from a hash function.
Question
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
How the community answered
(33 responses)- A3% (1)
- B6% (2)
- C3% (1)
- D88% (29)
Why each option
A collision attack in cryptography seeks to find two distinct inputs that produce the exact same hash output from a hash function.
Collision attacks target hash functions to find identical outputs for different inputs, not to derive a public key from a cryptographic system.
Breaking a hash into parts to get a plaintext value describes a different type of attack, typically a pre-image attack or brute-force attempt, not a collision attack.
This description of breaking a hash into parts is inaccurate and does not define a collision attack, which focuses on finding two distinct inputs yielding the same output.
A collision attack aims to find two different input messages (m1 and m2) such that their cryptographic hash values are identical (hash(m1) = hash(m2)). This undermines the integrity property of hash functions, as it becomes possible to substitute one message for another while maintaining the same hash, potentially for malicious purposes like forging digital signatures.
Concept tested: Cryptographic hash collision attack
Source: https://learn.microsoft.com/en-us/windows/win32/secgloss/h-gly
Topics
Community Discussion
No community discussion yet for this question.