Work out crc value instantly with clear inputs, formula shown and shareable results.
A CRC treats the message as a polynomial over GF(2) and returns the remainder after division by a generator polynomial. That algebraic structure guarantees detection of all burst errors shorter than the CRC width, which is why CRCs are used in Ethernet, USB and storage. It also makes them linear and therefore trivially forgeable, so a CRC is never a security control.
CRC computation
CRC = message polynomial mod generator polynomial over GF(2); CRC-32 uses reflected 0xEDB88320 with initial and final XOR of 0xFFFFFFFF
It is linear: CRC(a XOR b) = CRC(a) XOR CRC(b). An attacker can modify a message and adjust the CRC to match without any secret.
CRC-32 with the reflected 0xEDB88320 polynomial, the same variant computed here, appended as the frame check sequence.