RIPEMD-128 Hash

Technical details, regex signatures, and cracking commands for the RIPEMD-128 algorithm.

Regex Identification Signature:
(?:\$ripemd\$)?[a-f0-9]{32,40}$
Not supported natively by Hashcat
John the Ripper Command:
← Back to Hash Identifier

What is RIPEMD-128?

RIPEMD-128 (RACE Integrity Primitives Evaluation Message Digest) is a cryptographic hash function designed as part of the RIPEMD family, developed by Antoine Joux, Hans Dobbertin, and others in 1996 as a response to vulnerabilities in MD4-based hashes. Structurally, it operates as a Merkle-Damgård iterated hash function, processing input data in 512-bit blocks through a compression function composed of four parallel rounds (32 bits each) with distinct non-linear operations, including bit rotations, modular additions, and logical XORs. Unlike its longer counterpart RIPEMD-160, RIPEMD-128 produces a 128-bit (16-byte) hash output, making it theoretically resistant to brute-force attacks under ideal conditions with a collision resistance of approximately 2¹²⁸ operations. Its primary use-case was in digital signatures, checksum verification, and lightweight integrity checks where computational efficiency and moderate security were prioritized over high collision resistance.

RIPEMD-128 is vulnerable to cracking primarily due to its 128-bit output size, which, while sufficient for many applications in the mid-1990s, is now considered insufficient against modern computational resources. The lack of a built-in salt or keyed variant exposes it to rainbow table attacks, enabling precomputed lookups for common passwords. Additionally, its design lacks resistance to GPU/ASIC optimizations—modern parallel computing hardware can evaluate vast numbers of hash candidates per second, reducing the effective collision resistance to practical levels. Theoretical weaknesses in its compression rounds, such as potential differential or linear cryptanalysis paths, further exacerbate its susceptibility, though no practical attacks have yet broken it outright. Its obsolescence stems from the advent of stronger alternatives like SHA-256 and BLAKE3, which offer comparable speed with significantly higher security margins.

Identifying RIPEMD-128 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 RIPEMD-128, security researchers analyze the hash against a strict regular expression (regex) signature (shown above) to find structural matches.

How to Crack RIPEMD-128

If you need to recover the plaintext password for a RIPEMD-128 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.