Calculate CRC checksums for 100+ algorithms (CRC-8 through CRC-64, Adler-32, Fletcher-16) with a parameterized BigInt engine
114 presets available
Enter input above to compute the checksum.
Input bytes are processed MSB-first. The polynomial is applied without bit-reversal. Common in protocols like CRC-32/ISO-HDLC.
Each input byte is reflected (bit-reversed) before processing, and the final register is also reflected. Used in Ethernet, Bluetooth, and ZIP files.
Adler-32 and Fletcher-16 use modular addition rather than polynomial division. They are faster but offer weaker error detection than true CRC.
A Cyclic Redundancy Check (CRC) detects accidental changes to raw data. A sender computes a short fixed-size checksum and appends it; the receiver recomputes and compares.
Width, Poly, Init, XorOut, RefIn, and RefOut fully define any CRC variant. The BigInt engine here supports widths from 1 to 64 bits.
CRC is designed for error detection, not security. Cryptographic hashes (SHA-256, MD5) are collision-resistant; CRC is not. Use SHA for security-sensitive checks.
We use cookies
We use Google Analytics to understand how visitors use this site. No personal data is sold or shared with third parties. Privacy Policy