HP0-J73 · Question #128
Which hash-based algorithm for storage deduplication provides the lowest risk for hash collisions?
The correct answer is B. SHA-1. SHA-1 produces a 160-bit digest, making it the strongest hash listed for minimizing collision probability in deduplication use cases.
Question
Which hash-based algorithm for storage deduplication provides the lowest risk for hash collisions?
Options
- AAES-256
- BSHA-1
- CMD5
- DCRC32
How the community answered
(36 responses)- A8% (3)
- B75% (27)
- C14% (5)
- D3% (1)
Why each option
SHA-1 produces a 160-bit digest, making it the strongest hash listed for minimizing collision probability in deduplication use cases.
AES-256 is a symmetric encryption cipher, not a hashing algorithm - it is used for data confidentiality, not deduplication fingerprinting.
SHA-1 generates a 160-bit hash value, providing a significantly larger hash space than MD5 (128-bit) or CRC32 (32-bit), which directly reduces the probability of two different data blocks producing the same hash. Among the options listed, SHA-1 offers the best collision resistance for storage deduplication purposes.
MD5 produces a 128-bit hash and has well-documented collision vulnerabilities, making it less reliable than SHA-1 for deduplication integrity.
CRC32 generates only a 32-bit checksum designed for error detection in data transmission, not cryptographic uniqueness, and has a very high collision probability.
Concept tested: Hash algorithm collision resistance for deduplication
Source: https://learn.microsoft.com/en-us/windows-server/storage/data-deduplication/overview
Topics
Community Discussion
No community discussion yet for this question.