312-50V10 · Question #663
Which of the following algorithms can be used to guarantee the integrity of messages being sent, in transit, or stored? (Choose the best answer)
The correct answer is C. hashing algorithms. Hashing algorithms are the standard cryptographic tool for verifying data integrity because they produce a deterministic fixed-length digest that changes if the input is modified.
Question
Which of the following algorithms can be used to guarantee the integrity of messages being sent, in transit, or stored? (Choose the best answer)
Options
- Asymmetric algorithms
- Basymmetric algorithms
- Chashing algorithms
- Dintegrity algorithms
How the community answered
(24 responses)- A4% (1)
- C92% (22)
- D4% (1)
Why each option
Hashing algorithms are the standard cryptographic tool for verifying data integrity because they produce a deterministic fixed-length digest that changes if the input is modified.
Symmetric algorithms like AES provide confidentiality through encryption but do not inherently verify integrity unless combined with a message authentication code (MAC).
Asymmetric algorithms like RSA handle key exchange, digital signatures, and encryption - integrity verification within digital signatures relies specifically on the embedded hashing step, not the asymmetric cipher itself.
Hashing algorithms such as SHA-256 produce a unique fixed-length digest from any input. Even a single-bit change in the original data produces a completely different hash value, allowing recipients or systems to detect any tampering during transmission or storage. This one-way, collision-resistant property makes hashing the definitive mechanism for integrity assurance - not encryption.
'Integrity algorithms' is not a recognized cryptographic category and does not correspond to any standard algorithm class.
Concept tested: Hashing algorithms for data integrity verification
Source: https://learn.microsoft.com/en-us/dotnet/standard/security/cryptographic-services
Topics
Community Discussion
No community discussion yet for this question.