About the Book
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 68. Chapters: Cryptographic hash functions, Cyclic redundancy check, SHA-1, MD5, RIPEMD, Pearson hashing, Collision, Random oracle, One-way compression function, SHA-2, NIST hash function competition, Universal hashing, Fast Syndrome Based Hash, GOST, VEST, MinHash, Very smooth hash, SWIFFT, Merkle-Damgard construction, Provably secure cryptographic hash function, Elliptic curve only hash, LM hash, Comparison of file verification software, Comparison of cryptographic hash functions, Whirlpool, Keccak, MD2, Tiger, Hash tree, MD4, Hash function security summary, Java hashCode(), RadioGatun, Perfect hash function, Skein, Rolling hash, BLAKE, Fowler-Noll-Vo hash function, MD6, Identicon, MDC-2, List of hash functions, Md5sum, Zobrist hashing, Grostl, MurmurHash, Hash list, Examples of SHA digests, Jenkins hash function, SMASH, Universal one-way hash function, JH, HAVAL, Sha1sum, SANDstorm hash, Bitstate hashing, Locality preserving hashing, N-Hash, FORK-256, MASH-1, Hash filter, HAS-V, Morton number, Quantum fingerprinting, HAS-160. Excerpt: A cyclic redundancy check (CRC) is an error-detecting code designed to detect accidental changes to raw computer data, and is commonly used in digital networks and storage devices such as hard disk drives. A CRC-enabled device calculates a short, fixed-length binary sequence, known as the check value or improperly the CRC, for each block of data to be sent or stored and appends it to the data, forming a codeword. When a codeword is received or read, the device either compares its check value with one freshly calculated from the data block, or equivalently, performs a CRC on the whole codeword and compares the resulting check value with an expected residue constant. If the check values do not match, then the block contains a data error and the device may take corrective action such as rereading or...
