Checksum Totally Explained

Everything about Checksum totally explained

A checksum is a form of redundancy check, a simple way to protect the integrity of data by detecting errors in data that are sent through space (telecommunications) or time (storage). It works by adding up the basic components of a message, typically the asserted bits, and storing the resulting value. Anyone can later perform the same operation on the data, compare the result to the authentic checksum, and (assuming that the sums match) conclude that the message was most likely not corrupted.
An example of a simple checksum:

Given 4 bytes of data (can be done with any number of bytes): 0x25, 0x62, 0x3F, 0x52
Step 1: Adding all bytes together gives 0x118.
Step 2: Drop the Carry Nibble to give you 0x18.
Step 3: Get the two's complement of the 0x18 to get 0xE8. This is the checksum byte.
To Test the Checksum byte simply add it to the original group of bytes. This should give you 0x200.
Drop the carry nibble again giving 0x00. Since it's 0x00 this means no error was detected (although an undetectable error could have occurred).

The simplest form of checksum, which simply adds up the asserted bits in the data, can't detect a number of types of errors. Such a checksum, for example, isn't changed by:

Reordering of the bytes in the message.

Inserting or deleting zero-valued bytes.

Multiple errors which sum to zero. More sophisticated types of redundancy check, including Fletcher's checksum, Adler-32, and cyclic redundancy checks (CRCs), are designed to address these weaknesses by considering not only the value of each byte but also its position. The cost of the ability to detect more types of errors is the increased complexity of computing the redundancy check value.
These types of redundancy check are useful in detecting accidental modification such as corruption to stored data or errors in a communication channel. However, they provide no security against a malicious agent as their simple mathematical structure makes them trivial to circumvent. To provide this level of integrity, the use of a cryptographic hash function, such as SHA-256, is necessary. (Collisions have been found in the popular MD5 algorithm and finding collisions in SHA-1 seems possible, but there's no evidence as of 2006 that SHA-256 suffers similar weaknesses.)
On Unix, there's a tool called "cksum" that generates both a 32-bit CRC and a byte count for any given input file.

Further Information

Get more info on 'Checksum'.

External Link Exchanges

Do you know how hard it is to get a link from a large encyclopaedia? Well we're different and will prove it. To get a link from us just add the following HTML to your site on a relevant page:

<a href="http://checksum.totallyexplained.com">Checksum Totally Explained</a>

Then simply click through this link from your web page. Our crawlers will verify your link, extract the title of your web page and instantly add a link back to it. If you like you can remove the words Totally Explained and embed the link in article text.
As long as your link remains in place, we'll keep our link to you right here. Please play fair - our crawlers are watching. Your site must be closely related to this one's topic. Any kind of spamming, dubious practises or removing the link will result in your link from us being dropped and, potentially, your whole site being banned.