- Home
- md2
- md4
- md5
- sha1
- sha224
- sha256
- sha384
- sha512/224
- sha512/256
- sha512
- sha3-224
- sha3-256
- sha3-384
- sha3-512
- ripemd128
- ripemd160
- ripemd256
- ripemd320
- whirlpool
- tiger128,3
- tiger160,3
- tiger192,3
- tiger128,4
- tiger160,4
- tiger192,4
- snefru
- snefru256
- gost
- gost-crypto
- adler32
- crc32
- crc32b
- crc32c
- fnv132
- fnv1a32
- fnv164
- fnv1a64
- joaat
- murmur3a
- murmur3c
- murmur3f
- xxh32
- xxh64
- xxh3
- xxh128
- haval128,3
- haval160,3
- haval192,3
- haval224,3
- haval256,3
- haval128,4
- haval160,4
- haval192,4
- haval224,4
- haval256,4
- haval128,5
- haval160,5
- haval192,5
- haval224,5
- haval256,5

From Wikipedia, the free encyclopedia

Adler-32 is a checksum algorithm which was invented by Mark Adler. Compared to a cyclic redundancy check of the same length it trades reliability for speed. Compared to its original form (Fletcher-16), Adler-32 is more reliable than Fletcher-16. However, Adler-32 is slightly less reliable than Fletcher-32

It is a modification of the Fletcher checksum.

The Adler-32 checksum is part of the widely-used zlib compression library, as both were developed by Mark Adler. A "rolling checksum" version of Adler-32 is used in the rsync utility.

An Adler-32 checksum is obtained by calculating two 16-bit checksums *A* and *B* and concatenating their bits into a 32-bit integer. *A* is the sum of all bytes in the string plus one, and *B* is the sum of the individual values of *A* from each step.

At the beginning of an Adler-32 run, *A* is initialized to 1, *B* to 0. The sums are done modulo 65521 (the largest prime number smaller than 2^{16}). The bytes are stored in network order (big endian), *B* occupying the two most significant bytes.

Service provided by Fremnet.net

---== Copyright Shannon Wynter - All rights reserved - All wrongs avenged ==---

---== Copyright Shannon Wynter - All rights reserved - All wrongs avenged ==---