How to Use
- Choose Random or Memorable mode.
- Tune length, character sets, word count, or separators.
- Click Generate and review entropy + crack-time.
- Copy your password, or lock it to prevent regeneration.
Core Features
- Generate high-entropy random passwords with custom character sets.
- Create XKCD-style memorable passphrases that are easy to recall.
- Analyze password entropy and show a clear strength rating.
- Estimate crack time under different attacker speeds (CPU/GPU/cluster).
- Exclude ambiguous characters (O/0, l/1) for safer manual entry.
- Protect privacy with cryptographic, client-side randomness only.
Related Tools
Test password strength and estimated crack time with zxcvbn. The check runs locally in your browser, so your input is not uploaded.
Generate Bcrypt hashes locally and verify passwords against existing hashes with adjustable Cost/Rounds for auth development, migrations, and seed data.
Generate Ed25519, RSA-2048, or RSA-4096 SSH keys with browser Web Crypto. Copy an OpenSSH public key and download the private key as PKCS#8 PEM.
Decode and debug JWTs in your browserโno secret key, no uploads. Inspect header/payload, pretty-print JSON, and see a live exp countdown. Paste offline now.
Generate and sign JWTs for API testing. Edit header and payload, use HS256/HS384/HS512, and keep your secret local while HMAC signing runs in the browser.
Generate SHA-256, SHA-384, SHA-512 hashes and file checksums locally in your browser. Compare expected values, copy results, and verify files without uploads.
Calculation Logic
- Use
crypto.getRandomValuesfor cryptographic randomness. - A common entropy approximation is .
- Passphrases gain strength from the size of the word pool and number of words.
FAQ
- Is it free?
- Yes.
- Is my password uploaded or stored?
- No. Passwords are generated locally and disappear on refresh.
- Why are passphrases like โcorrect-horse-batteryโ better?
- Theyโre easier to remember while still high-entropy and hard to brute-force.
- How is entropy calculated? (Technical)
- A common approximation is , where L is length and N is the character set size.
- Why does length often beat โmore symbolsโ?
- Increasing length expands the search space exponentially, usually improving security more than adding complexity alone.