Hashing Tool

Input
Output

Online hashing tool supporting SM3 / BLAKE3 / bcrypt / Argon2. Runs entirely in the browser.

How to Use & FAQ5 steps · 8 Q&A

Hashing (SM3 / BLAKE3 / bcrypt / Argon2)

Online hashing tool supporting SM3 / BLAKE3 / bcrypt / Argon2. Runs entirely in the browser.

How to Use

  1. Choose an algorithm and parametersFor integrity checks choose SM3 / BLAKE3; for password storage choose bcrypt / Argon2 and tune cost / memory parameters.
  2. Enter the content to hashPaste text or a passphrase into the input box; bcrypt / Argon2 will prompt for a cost level.
  3. Compute the hashClick "Compute hash" to get the digest. A slow-hash algorithm takes longer on purpose — that is how it slows attackers.
  4. Copy or verifyCopy the digest for comparison; for password-style algorithms, use "Verify" by entering the plaintext and an existing hash to confirm a match.
  5. Saving notesSlow-hash output already includes the salt, so save the whole string; for ordinary hashes, record the algorithm name too so it can be reproduced later.

FAQ

Is hashing encryption?

Not strictly encryption. Hashing maps input of any length to a fixed-length digest and is one-way and irreversible — you cannot recover the original from the digest. It is used to verify integrity and store password digests, not to keep data secret.

Can MD5 / SHA1 still be used?

Not recommended for security-sensitive use — they are known to have collision risks (different inputs can be made to yield the same digest). This tool offers the more modern SM3 / BLAKE3, plus bcrypt / Argon2 for passwords.

Why are bcrypt / Argon2 better for storing passwords?

They are computationally expensive and support salting, which effectively resists brute-force and rainbow-table attacks. A one-shot SHA-256 is "too fast" for passwords — an attacker can try hundreds of millions of guesses per second. Use a slow hash for passwords.

What is a "salt" in hashing?

A salt is random data attached to each password so that the same password produces different digests, defending against rainbow tables and bulk cracking. bcrypt / Argon2 salt automatically and include the salt in the output — no manual handling needed.

Why do two hashes of the same input differ?

This is normal with automatic salting (bcrypt / Argon2): a different salt each time yields a different digest. Use the verification feature to compare instead of comparing the two output strings directly.

Which algorithm should I use to verify file integrity?

SHA-256 or stronger is recommended. MD5 / SHA-1 have known collision risks and are suitable only for non-security compatibility cases (e.g. de-duplication, not security checks).

Can hashing be used to "encrypt" a file?

No. Hashing is one-way: it only produces a digest for checking and cannot restore the file. Use symmetric encryption like AES to encrypt, and hashing only to verify.

Why is the SHA-256 of the same password always identical?

Because SHA-256 is unsalted, the same input always yields the same output — which is exactly why it is unsuitable for storing passwords directly: attackers can precompute tables (rainbow tables) mapping common passwords to hashes.