SHA-384 Hash

What is SHA-384?

SHA-384 is a cryptographic hash function derived from the **Keccak** family of algorithms, standardized as part of **SHA-3** (NIST FIPS 202) in 2015 to address perceived vulnerabilities in its predecessor, SHA-2. Structurally, it operates as a **sponge construction** with a 1600-bit (200-byte) state divided into an **absorption phase** (1024-bit capacity) and a **squeezing phase** (512-bit rate), processing input in 64-byte chunks via a 24-round permutation function. Unlike SHA-2’s fixed-width Merkle-Damgård construction, SHA-3’s sponge design enables variable-rate hashing and improved resistance to certain attack vectors, though it retains the same **384-bit output length** as SHA-256’s successor, SHA-512/256. Its primary use-case lies in cryptographic applications requiring stronger collision resistance than SHA-256—such as **digital signatures (e.g., EdDSA with SHA-384), TLS 1.3 handshakes, and blockchain systems**—where a 384-bit hash provides a balance between security margins and computational overhead.

SHA-384’s security relies on the **preimage resistance, second-preimage resistance, and collision resistance** of its 384-bit output, but its vulnerability stems from **computational efficiency and implementation flaws**. Modern **GPU/ASIC optimizations** (e.g., parallelized Keccak permutations) reduce the cost of brute-force attacks, with hardware-accelerated implementations achieving **~10^18 hashes per second** on specialized devices. While SHA-3’s sponge design mitigates some classical attack vectors (e.g., length-extension attacks), **lack of salting** in password hashing renders it unsuitable for direct use in credential storage without additional mechanisms like **Argon2 or PBKDF2**. Furthermore, **theoretical collision attacks** (e.g., via **birthday paradox scaling**) remain viable at ~2^192 operations, though practical attacks remain infeasible for well-implemented systems. Optimizations like **bit-slicing** or **lookup tables** further exacerbate side-channel vulnerabilities, while **implementation bugs** (e.g., incorrect padding or state updates) could degrade security to SHA-2 levels.

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

How to Crack SHA-384

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