Which password hashing algorithm should I use?

Argon2id is the current recommendation for new systems. bcrypt and scrypt are both still solid choices, especially where a library for them is already available.

Why is it slower than a normal hash?

That is by design. Password-hashing functions are intentionally slow and memory-hard so that guessing millions of passwords becomes impractical for attackers.

Does bcrypt have a password length limit?

Yes. bcrypt only uses the first 72 bytes of a password. For longer secrets, prefer Argon2id or scrypt.

Security & Cryptography

Password Hash Generator

Hash passwords with Argon2id, bcrypt or scrypt using a salt.

Free browser toolRuns in your browserNo sign-up

Algorithm

Argon2id is the modern default; bcrypt and scrypt are widely supported older options. Higher cost settings are slower to compute and harder to brute force.

Password

Salt (hex)

Iterations

Memory (KiB)

Parallelism

Hash length

Argon2id, bcrypt and scrypt are deliberately slow password-hashing functions. Everything runs in your browser (WebAssembly); nothing you enter is uploaded.

100% private - runs entirely in your browser.

Your input, keys and passwords are never uploaded. Want proof? Load this page, then turn off your internet - the tool still works. For an exact check, open your browser's DevTools Network tab and confirm no data is sent when you use it.

About the Password Hash Generator

Passwords should never be stored as plain text or with a fast hash. Instead they are protected with a slow, salted password-hashing function that is expensive to brute force.

This tool supports the three algorithms most recommended today: Argon2id, bcrypt and scrypt. You control the salt and the cost parameters, and it outputs the encoded hash ready to store and verify later.

Hashing runs in your browser through WebAssembly, so the passwords you enter are never uploaded.

Key features

Argon2id, bcrypt and scrypt in one tool
Random salt with one-click regeneration
Tunable cost: iterations, memory, parallelism, cost factor
Runs locally via WebAssembly

How to use

1Pick an algorithm and enter the password.
2Adjust the salt and cost parameters if needed.
3Click Generate hash, then copy the encoded result.

Examples

Create a salted bcrypt hash

Input: Password plus selected work factor

Output: A bcrypt hash beginning with its algorithm and cost fields

The random salt means hashing the same password twice produces different valid hashes.

Frequently asked questions

Which password hashing algorithm should I use?: Argon2id is the current recommendation for new systems. bcrypt and scrypt are both still solid choices, especially where a library for them is already available.
Why is it slower than a normal hash?: That is by design. Password-hashing functions are intentionally slow and memory-hard so that guessing millions of passwords becomes impractical for attackers.
Does bcrypt have a password length limit?: Yes. bcrypt only uses the first 72 bytes of a password. For longer secrets, prefer Argon2id or scrypt.

Open a related tool to prepare your files or refine the finished result.