Checksum: Difference between revisions

No change in size ,  1 year ago
m
Reverted edits by 185.24.237.171 (talk) to last version by Pbsouthwood
m (Reverted edits by 185.24.237.171 (talk) to last version by Pbsouthwood)
A '''checksum''' is a small-sized [[datum]] derived from a block of [[digital data]] for the purpose of [[error detection|detecting errors]] that may have been introduced during its [[telecommunication|transmission]] or [[computer storage|storage]]. It is usually applied to an installation file after it is received from the download server. By themselves, checksums are often used to verify data integrity but are not relied upon to verify data [[authentication|authenticity]].
 
The actual [[algorithm|procedure]] which fieldsyields the checksum from a data input is called a '''checksum function''' or '''[[checksum algorithm]]'''. Depending on its design goals, a good checksum algorithm will usually output a significantly different value, even for small changes made to the input. This is especially true of [[cryptographic hash function]]s, which may be used to detect many data corruption errors and verify overall [[data integrity]]; if the computed checksum for the current data input matches the stored value of a previously computed checksum, there is a very high probability the data has not been accidentally altered or corrupted.
 
Checksum functions are related to [[hash function]]s, [[fingerprint (computing)|fingerprint]]s, [[randomization function]]s, and [[cryptographic hash function]]s. However, each of those concepts has different applications and therefore different design goals. For instance, a function returning the start of a string can provide a hash appropriate for some applications but will never be a suitable checksum. Checksums are used as [[cryptographic primitive]]s in larger authentication algorithms. For cryptographic systems with these two specific design goals, see [[Hash-based message authentication code|HMAC]].