Hashes/Crypto

Hash Generator

Compute hashes of text or a file with thirteen algorithms at once: MD5, SHA-1, SHA-256, SHA-384, SHA-512, SHA3-256, SHA3-512, RIPEMD-160, BLAKE2b, BLAKE2s, BLAKE3, CRC32, and Adler-32.

A hash function turns arbitrary data into a fixed-length digest that's unique to that content — changing even one letter of the input completely changes the output. This tool computes a hash of text or a file using 13 popular algorithms at once, right in your browser.

Which algorithm to pick

Common uses

Things to keep in mind

Hashing isn't encryption — it's one-way, so you can't recover the original data from a hash.

Plain fast hashes (MD5, SHA-256) are unsuitable for passwords — use a dedicated slow algorithm like bcrypt, Argon2, or PBKDF2 instead.

Article about this tool: Hash Generator: how MD5, SHA-1, and SHA-256 differ from each other

Frequently asked questions

Which hash algorithm should I use?

For general-purpose checksums (file integrity, deduplication), SHA-256 is a solid modern default. Avoid MD5 and SHA-1 for anything security-sensitive, since both are broken against deliberate collision attacks, even though they're still fine for quick, non-adversarial checks.

Can a hash be reversed back to the original input?

No. Cryptographic hash functions are one-way — you can only verify a match by hashing another input and comparing the result, not recover the original data from the hash itself.

Does this tool upload my file or text to compute the hash?

No. All hashing runs locally in your browser via the Web Crypto API — nothing is sent to a server, so it works offline too.

Why do we even need SHA-3 if SHA-2 is still secure?

SHA-3 was chosen as insurance against a future vulnerability in SHA-2 — it's built on a fundamentally different internal construction (Keccak). Since no practical attacks on SHA-2 have been found, SHA-256 remains the default standard, and SHA-3 gets used selectively.

Does a longer hash automatically mean better protection?

Not always. Output length matters, but an algorithm's strength depends primarily on its internal construction — SHA-1, with its 160-bit output, is vulnerable to collisions, while a well-designed modern algorithm with a shorter output can be more secure.

Articles: Hashes/Crypto

Checksum Verifier: how to check that a file isn't corrupted

Why a matching checksum confirms a file's integrity, but not who created it.

HMAC: how a keyed hash differs from a regular hash

Why a plain SHA-256 doesn't protect against message tampering, but HMAC does.

Bcrypt: why passwords are hashed slowly, not quickly

Why fast SHA-256 is a bad choice for passwords, and slow bcrypt is the right one.

UUID: how identifiers that almost never repeat are generated

Why UUID v4 can be generated independently on millions of machines without collision risk.

Password Generator: what actually makes a password strong

Why a long dictionary-word password is stronger than a short one with symbols and digits.

AES: how symmetric encryption works

Why the same key both encrypts and decrypts data in AES, and how that differs from asymmetric encryption.

Argon2: why this algorithm won the password hashing competition

How Argon2 defends better against GPU-based attacks than older password hashing algorithms.

Scrypt: why the algorithm needs so much memory

Why scrypt deliberately demands a lot of memory to make cracking on ASIC devices harder.

TOTP: how one-time codes in authenticator apps work

Why the code in Google Authenticator works offline and syncs with the server only via time.

PBKDF2: the oldest key-stretching standard

Why the recommended PBKDF2 iteration count keeps growing every year.

X.509: what's inside an SSL certificate

What exactly the browser checks in a site's certificate before showing the green padlock.

PGP: how public-key and private-key encryption works

Why you can freely share a PGP public key but never the private one.