210-250 · Question #173
Which one of the following algorithms is most susceptible to collision when hashing different data sets?
The correct answer is A. MD5. MD5 generates a 128-bit hash and has well-documented, practical collision vulnerabilities, making it the weakest among the listed algorithms.
Question
Which one of the following algorithms is most susceptible to collision when hashing different data sets?
Options
- AMD5
- BSHA-1
- CSHA-256
- DSHA-512
How the community answered
(23 responses)- A87% (20)
- B9% (2)
- D4% (1)
Why each option
MD5 generates a 128-bit hash and has well-documented, practical collision vulnerabilities, making it the weakest among the listed algorithms.
MD5 produces only a 128-bit digest, giving it the smallest output space of the listed options, which mathematically increases collision probability. Researchers have demonstrated real-world collision attacks against MD5 since 2004, and it is considered cryptographically broken by NIST and the security community. Tools can generate MD5 collisions in seconds on modern hardware, making it unsuitable for integrity-sensitive applications.
SHA-1 also has known collision vulnerabilities (demonstrated by the SHAttered attack in 2017), but it produces a 160-bit digest and is harder to collide than MD5, making it less susceptible.
SHA-256 produces a 256-bit digest and has no known practical collision attacks, making it significantly more resistant than MD5.
SHA-512 produces a 512-bit digest and has the largest output space of the listed algorithms, making collisions computationally infeasible with current technology.
Concept tested: Comparative hash algorithm collision resistance
Source: https://csrc.nist.gov/projects/hash-functions
Topics
Community Discussion
No community discussion yet for this question.