It is often desirable to verify that a file hasn't been modified in transmission or storage by untrusted parties, for example, to include malicious code such as viruses or backdoors. Due to the nature of hash functions, hash collisions may result in false positives, but the likelihood of collisions is often negligible with random corruption. If these values match, the file is presumed to be unmodified.
CHECKSUM FILE VERIFICATION
Hash-based verification ensures that a file has not been corrupted by comparing the file's hash value to a previously calculated value. A file can become corrupted by a variety of ways: faulty storage media, errors in transmission, write errors during copying or moving, software bugs, and so on. A more popular approach is to generate a hash of the copied file and comparing that to the hash of the original file.įile integrity can be compromised, usually referred to as the file becoming corrupted. This can be done by comparing two files bit-by-bit, but requires two copies of the same file, and may miss systematic corruptions which might occur to both files. JSTOR ( September 2014) ( Learn how and when to remove this template message)įile verification is the process of using an algorithm for verifying the integrity of a computer file, usually by checksum.Unsourced material may be challenged and removed.įind sources: "File verification" – news Please help improve this article by adding citations to reliable sources.
This article needs additional citations for verification.
0 kommentar(er)
