Passphrase vs Password: Comparing Entropy

Six random dictionary words can match twelve fully random characters in raw entropy, and beat them on memorability. Compare the math behind passphrases and passwords directly.

ZERO UPLOAD · ALL LOCAL
  1. Type or paste a password into the input field — strength updates instantly as you type.
  2. Check the entropy bits and strength tier in the meter below the input.
  3. Review the crack time table to see how long each attack scenario would take against your password.
  4. Read the feedback panel for specific suggestions if zxcvbn detected patterns or weaknesses.
  5. Use the eye icon to unmask the password if you need to review what you typed.

Matching passphrase and password entropy tiers

  • 4 words ≈ 8 characters ~51.7 bits vs ~52.6 bits
  • 6 words ≈ 12 characters ~77.5 bits vs ~78.8 bits
  • 7 words ≈ 14 characters ~90.5 bits vs ~92.0 bits
  • Per-unit efficiency ~12.9 bits per word vs ~6.57 bits per character

Type or paste a password to analyse its strength.

Length
Character pool
Entropy
Pattern
Attack Scenarios GPU times assume raw brute-force of a stolen hash. Online times use pattern-aware estimation against a live service.
GPU — Fast Hash (NTLM, MD5) Est. crack time
RTX 4070 Ti Super 155 GH/s · 16 GB GDDR6X
RTX 5070 175 GH/s · 12 GB GDDR7
RTX 4090 300 GH/s · 24 GB GDDR6X
RTX 5090 410 GH/s · 32 GB GDDR7
GPU — Slow Hash (bcrypt cost 12 / Argon2id) Est. crack time
RTX 4070 Ti Super 740 H/s * · 16 GB GDDR6X
RTX 5070 670 H/s * · 12 GB GDDR7
RTX 4090 1,440 H/s * · 24 GB GDDR6X
RTX 5090 2,380 H/s * · 32 GB GDDR7
Online Attack Est. crack time
Throttled 100 guesses/hour — rate-limited login service
Unthrottled 10 guesses/second — no rate limiting

* bcrypt and Argon2id are deliberately slow password hashes, so their crack times depend entirely on the cost factor a site configures. These rates assume bcrypt at cost factor 12, a conservative legacy setting. OWASP's current guidance prefers Argon2id for new systems and lists bcrypt as a legacy fallback with a work factor of 10 or more. Published hashcat v6.2.6 benchmarks measure bcrypt at cost factor 5 (RTX 4090 at 184 kH/s, RTX 5090 at 305 kH/s); each step up the cost factor doubles the work, so cost 12 runs 128 times slower than the benchmark default. The RTX 4090 and RTX 5090 figures divide those benchmarks by 128, while the RTX 4070 Ti Super and RTX 5070 figures are scaled from their SM and core counts. Sources: hashcat RTX 4090, hashcat RTX 5090, and the OWASP Password Storage Cheat Sheet.

Passphrase vs Password: Comparing Entropy

Six words or twelve characters: both can land you in roughly the same 78-bit entropy tier, yet only one of them is realistically easy to type from memory without a mistake. A passphrase built from the EFF's Diceware wordlist earns about 12.9 bits per word, while a randomly generated character password drawing from the full 95-character printable ASCII pool earns about 6.57 bits per character.12 Because those two rates are so different, comparing passphrases and passwords by length alone tells you almost nothing useful. Comparing them by their actual entropy tells you exactly where each option sits, and which one fits a given situation better. This page lines up the two side by side, at matching entropy levels, so the tradeoff between memorability and character-count efficiency becomes concrete rather than abstract.

Matching entropy tier for tier

At roughly equal strength, a four-word Diceware passphrase (about 51.7 bits) sits close to an eight-character full-pool password (about 52.6 bits). A six-word passphrase (about 77.5 bits) sits close to a twelve-character full-pool password (about 78.8 bits). A seven-word passphrase (about 90.5 bits) sits close to a fourteen-character full-pool password (about 92.0 bits).12 Each pair represents roughly the same resistance to brute force, despite looking nothing alike.

Because the two options land in the same entropy tier, the choice between them comes down to what you can reliably produce and reproduce, not which one is mathematically superior in the abstract. A password manager removes the memorization question entirely for either format, which shifts the decision toward whichever you will type correctly and consistently by hand when the manager is not available. Eight words, at roughly 103.4 bits, lands beyond even a twenty-character full-pool password, which shows how quickly a passphrase catches up once you add just a couple more entries beyond the standard six-word baseline, without asking you to memorize anything more complex than two additional dictionary words.

Why tier parity matters more than character count

The takeaway is that length alone is a misleading comparison when two formats use very different alphabet sizes. A six-word passphrase reaches 77.5 bits with only 36 characters when spaces are included, while a twelve-character password from the 95-character pool reaches 78.8 bits using far fewer keystrokes. If a service forces lowercase-only passphrases, the same six words collapse toward much lower entropy, which is why the randomness of the word source dominates the calculation more than the raw count of words chosen.34 Anyone comparing the formats should treat the tier labels themselves as the meaningful boundary rather than obsessing over which side of 78 bits a given combination lands on, because that gap is small enough that attack cost, hashing speed, and user consistency matter more than the narrow difference between matching a twelve-character password or a six-word passphrase at roughly the same tier.

The numbers are close, but what each format demands of the user is not. CapyToolkit scores passphrases on that final question, which is why it surfaces different entropy values when the same passphrase is reused across services with different policy constraints or character caps; the format is the same, but the practical security is not.

Why passphrases resist the mistakes passwords invite

Typing twelve fully random characters correctly, on the first try, without a manager filling it in, is genuinely difficult; a single transposed symbol or missed shift key fails the login and forces a retry. Six recognizable words separated by spaces are comparatively forgiving, since your brain autocorrects a familiar word even under time pressure in a way it cannot autocorrect a random string of punctuation and mixed case.

The dictionary-attack tradeoff

That forgiveness only holds if the words themselves were chosen with genuine randomness rather than personal association. A phrase you constructed by picking words that felt memorable draws from a far smaller effective pool than the full 7,776-word list, collapsing exactly the entropy advantage a properly rolled Diceware passphrase provides.5 Dictionary-aware estimators like zxcvbn check for recognizable word patterns and frequency-ranked dictionaries, penalizing passphrases built from common or thematically related words.3 The security of a passphrase depends entirely on how the words were selected, not on the fact that they happen to be words.

When a character password still wins

Passphrases are entropy-inefficient per character typed. At roughly 1.8 bits per character, matching a password's 6.57 bits per character takes far more keystrokes to reach the same strength.45 That inefficiency matters when a system enforces a strict character cap, twenty characters or fewer is common on older systems, since a short cap leaves little room for a multi-word phrase to reach meaningful entropy.

When spaces themselves become a liability

Some systems also reject spaces entirely, forcing you to either remove them (which can accidentally merge words into new dictionary terms) or substitute a delimiter, both of which change the entropy calculation. In these constrained situations, a randomly generated character password, which you can size by weighing word count against character count in bits, packs more entropy into a fixed length budget than any passphrase can, making it the more practical choice despite being harder to memorize.

When to use this

Choose a passphrase for anything you need to type from memory regularly without a password manager present, most commonly your device unlock code or your password manager's own master password. Choose a fully random character password for anything a manager will autofill, or for any system with a strict length cap or a ban on spaces that would undercut a passphrase's entropy efficiency. When in doubt, default to whichever format you can reproduce correctly on the first attempt under stress, since a technically stronger secret you keep mistyping is less useful than a slightly weaker one you enter correctly every time.

Examples

Master password for a password manager

A six or seven-word Diceware passphrase is the standard recommendation here, since this is the one password you genuinely need to type from memory, often under time pressure.

A service account secret generated and stored by your infrastructure, never typed by a human

Use a fully random character string at maximum pool size. There is no memorability benefit to a passphrase when nothing ever needs to recall it manually.

A legacy admin portal that caps passwords at 16 characters and disallows spaces

A random character password reaches far more entropy inside that constraint than any passphrase could, since spaces cannot be used and the character budget is tight.

Sources
  1. 1.

    Electronic Frontier Foundation, "EFF's New Wordlists for Random Passphrases," eff.org, July 2016. https://www.eff.org/deeplinks/2016/07/new-wordlists-random-passphrases

  2. 2.

    Wikipedia, "Password strength," en.wikipedia.org, accessed July 2026. https://en.wikipedia.org/wiki/Password_strength

  3. 3.

    Dropbox, "zxcvbn README," github.com, accessed June 2026. https://github.com/dropbox/zxcvbn/blob/master/README.md

  4. 4.

    NIST, "Digital Identity Guidelines: Authentication and Authenticator Management," SP 800-63B, pages.nist.gov, accessed July 2026. https://pages.nist.gov/800-63-4/sp800-63b.html

  5. 5.

    NIST, "Strength of Memorized Secrets (Appendix A)," SP 800-63B, github.com/usnistgov, accessed July 2026. https://github.com/usnistgov/800-63-3/blob/nist-pages/sp800-63b/appA_memorized.md

FAQ