Adler-32
Sign in to saveAdler-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.
Wikidata facts
- Instance of
- hash function
- Based on
- Fletcher's checksum
- Creator
- Mark Adler
Show 1 more fact
- inception
- 1995-00-00
Sources (1)
via Wikidata · CC0
~8 min read
Encyclopedic overview
10 sectionsContents
- History
- Calculation
- Example
- Comparison with the Fletcher checksum
- Example implementation
- Advantages and disadvantages
- Weakness
- See also
- Notes
- External links
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.
== History ==
Excerpted from Wikipedia’s “Adler-32” article, available under the CC BY-SA 4.0 licence.