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.
~8 min read
Article
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 ==
Connections
Fletcher's checksum
Entity
cyclic redundancy check
Entity
Q15777
Entity
algorithm
Entity
prime number
Entity
byte
Entity
Q8815
Entity
composite number
Entity
modular arithmetic
Entity
Request for Comments
Entity
checksum
Entity
word
Entity
16-bit computing
Entity
endianness
Entity
SIMD
Entity
Stream Control Transmission Protocol
Entity
rsync
Entity
zlib
Entity
Mark Adler
Entity
Hierarchical Data Format
Entity