Hash Algorithm for Data Integrity Verification
Which of the following is an algorithm performed to verify that data has not been modified?
Community Votes
63% of anonymous learners picked answer A. Votes are pick records left by other test-takers — they are not the verified answer.
Community Insight
The exam tests the nuance between error detection (checksum) and integrity verification (hash), with the common trap being the selection of checksum due to its simpler definition of 'checking' data.
This question tests the ability to distinguish between hash functions and checksums in the context of data integrity. It establishes that cryptographic hashing is the superior method for verifying that data has not been modified, especially against intentional tampering.
Candidates often select D (Checksum) because it is technically an algorithm used to detect errors, but they fail to recognize that Hash algorithms are designed specifically for robust integrity verification and security, making them the better answer for 'not modified'.
Community Discussion (23 comments)
Comments & Corrections
No comments yet — spotted an error or have a note? Share it below.
Expert Analysis
Why the Answer Is Correct
A hash algorithm is the correct choice because it produces a fixed-size digest that is highly sensitive to any change in input data. In cybersecurity contexts, particularly for certifications like CompTIA Security+, 'verifying data has not been modified' implies ensuring integrity against both accidental corruption and malicious tampering. Cryptographic hash functions (like SHA-256) are designed to be collision-resistant and pre-image resistant, providing a strong assurance that the data is authentic and unaltered.Why the Other Options Are Wrong
Code check (B) is too vague and not a standard cryptographic term for integrity. Encryption (C) is used for confidentiality, not primarily for integrity verification; while some modes provide integrity, encryption alone does not verify modification without additional mechanisms like MACs or digital signatures. Checksum (D) is the most common distractor; while checksums detect accidental errors (like transmission noise), they are not cryptographically secure and can be easily manipulated by an attacker to maintain the same checksum after modifying the data.Community Comment Notes
Many learners initially chose Checksum, arguing that it detects errors in transmission. However, comments highlighted that Hashes are 'better' and more 'robust' for integrity. One commenter noted that checksums are 'simpler and less secure,' intended only for error detection, whereas hashes are 'resistant to intentional tampering.' Another pointed out that the question asks for an 'algorithm' and while both are algorithms, the semantic weight of 'verify not modified' leans toward the cryptographic strength of hashing. The consensus among top-voted comments supports A as the definitive answer for integrity assurance.Official Reference
Exam Strategy
When asked about data integrity, look for keywords like 'tamper-proof', 'authenticity', or 'cryptographic'. If both Hash and Checksum are options, choose Hash unless the scenario specifically mentions simple error detection in non-security critical transmissions (e.g., basic network packet validation).
Frequently Asked Questions
Why is Checksum wrong if it also checks data?
Checkums detect accidental errors but lack cryptographic security. They cannot reliably verify that data was not intentionally modified by an attacker.
What is the difference between Hash and Encryption?
Encryption protects confidentiality by scrambling data with a key. Hashing creates a fixed digest to verify integrity; it is one-way and does not use a key for decryption.