How to Use all-hashes
- Type or paste the text you want to hash into the input field.
- All five hash algorithms run simultaneously — MD5, SHA-1, SHA-256, SHA-384, and SHA-512.
- Compare the digests side by side in the results panel.
- Click any hash value to copy it to your clipboard.
Hashing converts arbitrary text into a fixed-length fingerprint — deterministic, one-way, and collision-resistant. This tool runs MD5, SHA-1, SHA-256, SHA-384, and SHA-512 in parallel using the Web Crypto API, giving you all five digests at once so you can choose the right algorithm or verify checksums across formats in a single pass.
Choosing the Right Hash Algorithm
MD5 and SHA-1 are fast but cryptographically broken — fine for checksums and deduplication, but never for password storage or digital signatures. SHA-256 is the current standard for most security applications. SHA-384 and SHA-512 offer larger output sizes suited for highly sensitive contexts or when you need extra collision resistance. Running all five simultaneously lets you cross-check third-party hash values without switching tools.
- MD5 · SHA-1 · SHA-256 · SHA-384 · SHA-512 computed in parallel
- Uses the browser's native Web Crypto API — the same engine that powers HTTPS
- Output in lowercase hex by default; click to copy any digest
- Handles Unicode input — emoji, accented characters, and CJK text all hash correctly
Frequently Asked Questions
Which hash should I use for passwords?
None of these — you need a slow, salted KDF like bcrypt, Argon2, or scrypt. Fast hashes like SHA-256 can be brute-forced at billions of guesses per second with a GPU. See the Bcrypt Generator tool.
Why does MD5 produce a 32-character string when it's 128 bits?
Each hex character represents 4 bits. 128 ÷ 4 = 32 characters. SHA-256 produces 64 hex characters (256 bits), and SHA-512 produces 128 (512 bits).
Are MD5 and SHA-1 safe to use at all?
They are safe for non-security purposes: file deduplication, cache keys, or verifying a download matches a known checksum. They are unsafe for security-sensitive use because collision attacks are practical.
Does the same text always produce the same hash?
Yes — hashing is deterministic. The same input always yields the same digest for a given algorithm. Even a single added space produces a completely different hash.
See also the dedicated SHA-256 tool, HMAC generator, and the Bcrypt Generator for password hashing.