Hawkynt

CRC-128-BIGDATA

Big Data variant designed for distributed storage systems and massive dataset integrity Uses 128-bit polynomial with normal input processing.

Properties

Property	Value
Category	Checksums
Sub-category	Cyclic Redundancy Check
Security status	🎓 Educational Only
Complexity	Advanced
Inventor	W. Wesley Peterson
Year	1961
Origin	🇺🇸 United States
Source	algorithms/checksum/crc.js

Security

Status: 🎓 Educational Only

Known vulnerabilities

Issue	Description	Mitigation
Not Cryptographically Secure	CRC is designed for error detection, not security. It can be easily manipulated by attackers who know the algorithm.	Use cryptographic hash functions (SHA-256, SHA-3) for security purposes. Use CRC only for error detection.
Hash Collisions	CRC-128 has limited output space, making collisions relatively easy to find intentionally.	For security applications, use cryptographic hash functions with larger output sizes.

Documentation

• CRC Theory
• CRC Catalogue
• CRC Applications

References

• Peterson and Brown Paper
• CRC Parameter Database

Test vectors

2 vectors ship with this algorithm and run in the test suite. Byte values are hexadecimal.

Vector 1 — Empty string

Source: BigData test vector

Field	Value
input	(empty)
expected	00000000000000000000000000000000

Vector 2 — Big data sample

Source: BigData test vector

Field	Value
input	626967206461746120696e746567726974792074657374
expected	a9d63dcd9e4b92530cb8861b98fdcef8

---

← All algorithms

This site is open source. Improve this page.