24-bit CRC used in Interlaken protocol for high-speed chip-to-chip communication Uses 24-bit polynomial with normal input processing.
| Property | Value |
|---|---|
| Category | Checksums |
| Sub-category | Cyclic Redundancy Check |
| Security status | 🎓 Educational Only |
| Complexity | Intermediate |
| Inventor | W. Wesley Peterson |
| Year | 1961 |
| Origin | 🇺🇸 United States |
| Source | algorithms/checksum/crc.js |
Status: 🎓 Educational Only
No vulnerabilities are recorded for this implementation.
3 vectors ship with this algorithm and run in the test suite. Byte values are hexadecimal.
Vector 1 — Empty string
| Field | Value |
|---|---|
input |
(empty) |
expected |
000000 |
Vector 2 — Single byte ‘a’
| Field | Value |
|---|---|
input |
61 |
expected |
d80156 |
Vector 3 — String ‘123456789’
| Field | Value |
|---|---|
input |
313233343536373839 |
expected |
b4f3e6 |