Password Generator
Estimated time to crack: — (average, offline attack at 10 billion guesses per second)
Length
Character sets
Bulk output is useful for provisioning accounts or seeding a password manager import. The list exists only in this text box until you copy or download it.
A password generator that never sees your passwords
Create cryptographically secure passwords, memorable passphrases, and PINs directly in your browser. Nothing you generate ever leaves your device, and you can verify that yourself: the page keeps working with your internet connection switched off. Every estimate shown above comes from published entropy math, not a black box, and the full formula is explained in the sections below.
What makes a password strong?
A strong password is long, random, and unique. Length matters most: a randomly generated 16-character password drawn from letters, digits, and symbols has about 105 bits of entropy, which puts a brute-force attack far beyond practical reach. Randomness must come from a generator, not a human, and every account needs its own password so one breach cannot unlock the rest.
Length figures derive from entropy math shown in the entropy section below. Guidance on length over complexity follows NIST Special Publication 800-63B.
How strong is my password?
Type or paste a password to estimate its entropy and the time a brute-force attack would need. The check runs entirely in your browser. Nothing is sent anywhere, logged, or stored, and the field never autosaves.
This estimate assumes the password is random. Real passwords built from names, dates, and dictionary words fall to pattern-based attacks far faster than raw entropy suggests, so treat this number as an upper bound. Never test a password you actively use on any website, including this one; test a similar pattern instead.
How long does it take to crack a password?
The table shows the average time to brute-force a truly random password at 10 billion guesses per second, a rate achievable by a multi-GPU rig attacking a fast hash such as MD5 or NTLM. Slow hashes like bcrypt or Argon2 multiply every figure by thousands. All values are computed directly from pool size and length, so you can verify them yourself with the formula in the entropy section.
| Length | Lowercase only (26) | Upper + lower (52) | Letters + digits (62) | All printable (94) |
|---|---|---|---|---|
| 8 characters | 10 seconds | 45 minutes | 3 hours | 3.5 days |
| 10 characters | 2 hours | 83 days | 1.3 years | 85 years |
| 12 characters | 55 days | 618 years | 5,100 years | 755,000 years |
| 14 characters | 102 years | 1.7 million years | 19.6 million years | 6.7 billion years |
| 16 characters | 69,000 years | 4.5 billion years | 76 billion years | 59 trillion years |
| 20 characters | 8 billion years | 10^17 years | 10^19 years | 10^21 years |
Password entropy explained
Entropy measures how unpredictable a password is, in bits. The formula is simple: entropy = length × log₂(pool size). Each extra bit doubles the number of guesses an attacker needs, which is why length beats complexity: adding one character to a full-charset password adds 6.55 bits, multiplying the attacker's work by roughly 94.
| Character set | Pool size | Bits per character | Length needed for 80 bits |
|---|---|---|---|
| Digits only | 10 | 3.32 | 25 |
| Lowercase letters | 26 | 4.70 | 18 |
| Upper + lowercase | 52 | 5.70 | 15 |
| Letters + digits | 62 | 5.95 | 14 |
| All printable ASCII | 94 | 6.55 | 13 |
| Diceware word (EFF long list) | 7,776 words | 12.9 per word | 7 words |
What most online password generators are missing
We audited the typical feature set of popular online generators before building this one. Most offer a single random mode with a length slider and stop there. Here is what this tool adds.
| Capability | Typical online generator | This tool |
|---|---|---|
| Random passwords with charset control | Yes | Yes |
| Diceware-style passphrases | Rare | Yes, with separators and casing |
| Pronounceable mode | Rare | Yes, with honest entropy reporting |
| PIN generator | Sometimes | Yes |
| Live entropy in bits | Almost never | Yes, on every keystroke |
| Crack-time estimate with stated assumptions | Rare, assumptions hidden | Yes, formula published on page |
| Bulk generation with copy and .txt export | Almost never | Up to 100 at once |
| Color-coded character classes for easy transcription | No | Yes |
| Exclude look-alike characters | Sometimes | Yes |
| Custom character injection | Rare | Yes |
| Built-in strength checker | Separate page, often server-side | Same page, fully local |
| Works offline | Sometimes | Yes, single self-contained page |
| Unbiased randomness (rejection sampling) | Unverifiable | Yes, view source to confirm |
How to create a strong password
Follow these five steps to generate and store a password that will outlast any realistic brute-force attack.
Pick a length of 16 characters or more
Set the length slider to at least 16. At full charset that yields about 105 bits of entropy, comfortably above the 80-bit benchmark for resisting offline attacks.
Enable all four character sets
Keep lowercase, uppercase, digits, and symbols switched on. A larger pool raises bits per character, so the same length buys more security.
Generate and copy the password
Click Generate new password, then use the copy button or press C. The password is produced by your browser's cryptographic random number generator, never by a server.
Store it in a password manager
Paste the password into a reputable password manager rather than a note or spreadsheet. A manager removes the need to memorize anything, which removes the temptation to reuse.
Never reuse it, and add two-factor authentication
Use one unique password per account so a breach at one service cannot cascade. Turn on two-factor authentication wherever it is offered; it protects you even if the password leaks.
What NIST recommends for passwords
NIST Special Publication 800-63B sets the password guidance used across US government systems and widely adopted by industry. Its key points overturn several habits that older corporate policies still enforce.
Length over complexity rules
NIST advises against forcing arbitrary composition rules such as one uppercase, one digit, one symbol. People satisfy them predictably (Password1!), which helps attackers more than it helps defenders. Length and randomness are the recommended controls.
No forced periodic resets
Scheduled password expiry pushes people toward incremental changes like appending a counter. NIST recommends requiring a change only when there is evidence of compromise.
Screen against breached lists
Verifiers should check new passwords against lists of known compromised passwords and reject matches. A perfectly formatted password that already sits in a breach corpus offers no protection.
Allow long passphrases and paste
Systems should accept passwords of at least 64 characters, permit spaces, and allow pasting so password managers work smoothly. Blocking paste actively harms security.
Random password vs passphrase: which should you use?
Both reach strong entropy. The right choice depends on whether a password manager types it for you or you type it yourself.
Six password mistakes that defeat any generator
A perfect password handled badly protects nothing. These are the failure modes that show up over and over in real breach postmortems.
Reusing one password everywhere
Credential stuffing attacks replay leaked email and password pairs against hundreds of other sites. One breach becomes many.
Generate a unique password per account and let a manager remember them.Personal information as a base
Names, birthdays, pets, and teams are the first candidates in any targeted attack and appear in every cracking wordlist.
Use output from a random generator with no connection to your life.Predictable substitutions
P@ssw0rd! feels clever but l33t substitutions are standard rules in cracking tools and add almost no real entropy.
Add genuine length instead of decorating a dictionary word.Keyboard walks
qwerty, 1q2w3e4r, and zxcvbn patterns are in every wordlist precisely because they feel random while being anything but.
Trust the generator, not your fingers.Storing passwords in plain text
A notes app, a spreadsheet, or an email draft turns one device compromise into a full account takeover kit.
Use an encrypted password manager protected by a strong passphrase.Skipping two-factor authentication
Even strong passwords can leak through phishing or a breached service. Without a second factor, the password is the whole defense.
Enable an authenticator app or hardware key on important accounts.Password security terms, defined
- Entropy
- A measure of unpredictability in bits. Each additional bit doubles the number of guesses required to exhaust the search space. Calculated as length multiplied by log base 2 of the character pool size.
- CSPRNG
- Cryptographically secure pseudorandom number generator. A random source designed so its output cannot be predicted even by an attacker who sees previous outputs. Browsers expose one through the Web Crypto API as crypto.getRandomValues.
- Brute-force attack
- Trying every possible combination until the right one is found. Feasible against short passwords and fast hashes; infeasible against long random passwords.
- Dictionary attack
- Trying words, names, and known leaked passwords, plus common mutations, before resorting to brute force. This is why human-chosen passwords fall faster than their length suggests.
- Credential stuffing
- Replaying username and password pairs leaked from one breach against other services, exploiting password reuse.
- Diceware
- A passphrase method that selects words at random from a fixed list, traditionally with physical dice. The EFF long list contains 7,776 words, giving about 12.9 bits of entropy per word.
- Rejection sampling
- A technique for converting raw random bytes into unbiased choices from a pool whose size does not divide evenly into 256. Naive modulo arithmetic skews results toward early characters; rejection sampling discards out-of-range bytes instead.
- Password hashing
- Storing a one-way transformation of a password instead of the password itself. Slow, salted algorithms such as bcrypt, scrypt, and Argon2 are designed to make offline guessing expensive.