A broad alphabet
Enable all four sets for a mixture of lowercase, uppercase, digits, and the displayed symbol collection. No particular class is guaranteed to appear in each password.
Create random passwords from a character alphabet you control. Each position is sampled independently using Web Crypto and rejection sampling. The tool shows the alphabet size and the entropy calculation so you can understand the assumptions behind the output.
Each character is independently sampled from the combined alphabet. Selected sets are allowed, but a password need not contain a character from every set.
Entropy = length × log₂(alphabet size), assuming uniform independent Web Crypto samples. This is not a cracking-time prediction.
Passwords are generated locally. Copy exports the real values even when masked; a downloaded text file is plaintext.
Choose a length from 8 to 128 and enable the character sets accepted by your service.
Optionally remove the listed lookalike characters, choose up to 20 passwords, and select Generate passwords.
Reveal, copy, or download the output deliberately, then clear it when finished.
Enable all four sets for a mixture of lowercase, uppercase, digits, and the displayed symbol collection. No particular class is guaranteed to appear in each password.
Exclude the listed ambiguous characters to reduce some transcription mistakes. The smaller alphabet also reduces the theoretical entropy at a fixed length.
Twenty independently selected characters from an alphabet of 64 give 20 × log₂(64) = 120 bits under the uniform-sampling assumption.
A raw random 32-bit word does not divide evenly into every alphabet size. This implementation rejects the incomplete high-end interval before taking a remainder, so each character has an equal number of source values. It uses the browser’s cryptographic random generator, not a seeded demo or Math.random.
The selected sets define what may appear. The generator does not force at least one character from each set, because that would change the distribution and entropy assumptions. If a site requires a specific composition, review the generated value or use its approved password workflow.
The displayed number is length multiplied by log₂ of alphabet size. It assumes independent, uniform samples and no outside information about the password. It is not a prediction of cracking time, and it does not account for reuse, phishing, compromised devices, or how a service stores passwords.
Masking reduces casual screen exposure. It does not encrypt the page’s memory, clipboard, or downloaded file.
No. Every position is independently sampled from the union of selected sets. A selected set is permitted, not mandatory.
The tool keeps them in page memory while displayed. It does not write them to local storage or URL parameters. Your clipboard and downloads have separate lifetimes.