Generate multiple hash types (MD5, SHA-1, SHA-256, SHA-512) from a single text input for easy comparison.
Every text string, however long, reduces to a fixed-length fingerprint: 128 bits for MD5, 160 for SHA-1, 256 for SHA-256, 512 for SHA-512. Type or paste a string and this tool computes all four side by side as lowercase hex, so you can compare digests at a glance. The operation is one-way: a hash cannot be turned back into the text, and the same string always produces the same digest. The usual surprise is that a hash is not encryption - it is a fingerprint for comparison, and MD5 and SHA-1 are no longer collision-resistant enough for security use.
A concrete input and expected output from the current implementation.
Input
abc
Expected output
MD5: 900150983cd24fb0d6963f7d28e17f72 SHA-1: a9993e364706816aba3e25717850c26c9cd0d89d SHA-256: ba7816bf8f01cfea414140de5dae2223b00361a396177a9cb410ff61f20015ad SHA-512: ddaf35a193617abacc417349ae20413112e6fa4e89a97ea20a9eeee64b55d39a2192992a274fc1a836ba3c23a3feebbd454d4423643ce80e2a9ac94fa54ca49f
These are the standard test vectors published in the algorithm specifications, printed in lowercase hex: 32, 40, 64 and 128 characters for MD5, SHA-1, SHA-256 and SHA-512. Hash any other tool's output for 'abc' and it must match these values exactly.
The text you enter is converted to bytes and those exact bytes are fed through each algorithm. Hashing is deterministic: the same bytes always produce the same digest, and changing a single character reshapes the entire output. Each algorithm emits a fixed length - 32, 40, 64 or 128 lowercase hex characters - so the digest carries no information about how long the input was.
A digest is a fingerprint: to verify, you hash again and compare character by character. Because the output is plain hex, one differing character means the byte inputs differed, which is why a match is meaningful for large inputs. The caveat is that for MD5 and SHA-1, distinct inputs with the same digest are now practical to construct, so a match between those proves nothing against a deliberate adversary.
No. These algorithms are one-way by design, and the tool cannot recover your input from its digest - for typical inputs nothing can, except guessing. What you can do here is hash candidate strings and compare digests: you will find the original only by recognizing a match. Keep the source text if you need it back.
Not for storage. All four algorithms are fast, unsalted and deterministic, so short passwords hash quickly and can be checked against precomputed tables, and MD5 and SHA-1 additionally have known collisions. Password storage should use a slow, salted, memory-hard function such as bcrypt, scrypt or Argon2. For plain comparison and checksum use, this tool is fine, and it runs entirely in your browser.
The example and behavioral notes were checked against the browser implementation. Standards and primary references below define the relevant format, formula, or platform behavior.
Generate strong, random passwords with customizable length, character sets, and complexity requirements.
Analyze password strength with entropy scoring, crack-time estimates, and improvement suggestions.
Create cryptographically random strings for API keys, tokens, salts, and unique identifiers.
Create QR codes for URLs, text, Wi-Fi credentials, vCards, and more with customizable size and colors.
Scan and decode QR codes from uploaded images or your device camera to extract embedded data.
Compute MD5, SHA-1, SHA-256, and SHA-512 checksums to verify file integrity and detect tampering.