Checksum algorithms

thumb|ISSN for Pilgrims of Saint Michael|Vers Domain, encoded in an EAN-13 barcode with sequence variant 0 and issue number 05 thumb|Example of an ISSN, 2049-3630, encoded in an International Article Number (EAN)|EAN-13 bar code, with explanation thumb|ISSN expanded with sequence variant 0 to a Global Trade Item Number|GTIN-13 and encoded in an [[EAN-13 barcode with an EAN-2 add-on designating issue number 13]]

alphanumeric identifier for a bank account in any participating country, structure defined in ISO 13616

cellphone identification code

thumb|330px|right|Effect of a typical checksum function (the Unix cksum utility)

simple checksum formula

In cryptography, SHA-1 (Secure Hash Algorithm 1) is a hash function which takes an input and produces a 160-bit (20-byte) hash value known as a message digest – typically rendered as 40 hexadecimal digits. It was designed by the United States National Security Agency, and is a U.S. Federal Information Processing Standard. The algorithm has been cryptographically broken but is still widely used.

SHA-2 (Secure Hash Algorithm 2) is a set of cryptographic hash functions designed by the United States National Security Agency (NSA) and first published in 2001. They are built using the Merkle–Damgård construction, from a one-way compression function itself built using the Davies–Meyer structure from a specialized block cipher.

barcode symbology used for tracking trade items in stores

cksum is a shell command for generating a checksum for a file or stream of data. The command reports the 32-bit cyclic redundancy check (CRC) checksum and byte count for each file specified in the command-line arguments or for standard input if no arguments provided. The CRC value is different from the CRC-32 used with a ZIP file, PNG or zlib.

identifier for printed music developed by ISO

Wikipedia article covering the BLAKE series of cryptographic hash functions

international standard covering the coding, identification and marking of shipping containers

Adler-32 is a checksum algorithm written by Mark Adler in 1995, modifying Fletcher's checksum. Compared to a cyclic redundancy check of the same length, it trades reliability for speed. Adler-32 is more reliable than Fletcher-16, and slightly less reliable than Fletcher-32.

file format for storing CRC32 checksums

cryptographic hash function

check digit algorithm presented by H. Michael Damm

error detection algorithm