FNV-132 Hash
Technical details, regex signatures, and cracking commands for the FNV-132 algorithm.
What is FNV-132?
The FNV-132 hash algorithm was conceived in 1991 by Glen Fyodorowich and Mark Jenkins as part of the FNV (Fowler–Noll–Vo) family of non-cryptographic hash functions, designed to minimize collisions while maintaining computational efficiency. Structurally, FNV-132 operates as a 132-bit hash function, leveraging a fixed offset basis (2^132) and a prime multiplier (16777619) to iteratively process input bytes through a bitwise XOR and multiplication operation, producing a final hash value. Its primary use-case stems from its deterministic nature and low collision probability, making it suitable for non-security-critical applications like network routing (e.g., Cisco’s early implementations) and checksum validation, where speed and simplicity outweigh cryptographic guarantees. Unlike cryptographic hashes, FNV-132 lacks iterative refinement or keyed components, prioritizing performance over resistance to adversarial attacks.
FNV-132’s vulnerabilities stem from its design trade-offs: its fixed offset and prime multiplier render it susceptible to brute-force collisions due to the absence of a salt or key, enabling attackers to exploit predictable patterns in hash outputs. The algorithm’s linear processing—where each byte contributes multiplicatively—allows for GPU/CPU-optimized collision searches via rainbow tables or birthday paradox attacks, given its 132-bit output space (≈2^112 unique keys). Additionally, its deterministic nature eliminates defense-in-depth mechanisms like salting, while parallelizable computation exacerbates cracking efficiency, making it unsuitable for security-sensitive contexts where collision resistance is paramount.
Identifying FNV-132 Hashes
Identifying a hash blindly is often difficult because multiple algorithms can output strings of the exact same length. For example, a standard 32-character hexadecimal string could be MD5, NTLM, MD4, or LM. To definitively identify FNV-132, security researchers analyze the hash against a strict regular expression (regex) signature (shown above) to find structural matches.
How to Crack FNV-132
If you need to recover the plaintext password for a FNV-132 hash during a penetration test or forensics investigation, you must supply the correct module ID to your cracking software. Use the exact commands provided at the top of this page to target the hash successfully.