Password Combination Calculator

Find the number of possible passwords and theoretical entropy from password length and character-set size.

Password search-space calculator
Assume every position can independently use any character in the selected character set.

About password combinations

A password combination count describes the size of the theoretical search space when each position can contain any character from a fixed set. If a password has L positions and C possible characters are allowed at every position, the number of distinct strings is C raised to the power L. A six-digit PIN therefore has 10⁶, or one million, possible values when leading zeros are allowed. An eight-character lowercase password has 26⁸ possible strings. The calculator also converts the search space to bits of entropy by taking its base-two logarithm. One bit doubles the number of possibilities. This value is theoretical entropy: it assumes passwords are chosen independently and uniformly from the entire space. Human-created passwords rarely satisfy that assumption. Common words, keyboard patterns, names, substitutions, and reused credentials concentrate choices into a much smaller effective search space. A password manager that generates random characters is more likely to approach the estimate. Character-set size should represent the characters that are genuinely available at every position. Decimal digits provide 10 choices, lowercase English letters provide 26, mixed uppercase and lowercase letters plus digits provide 62, and the common printable ASCII range contains 94 characters. If a policy forces one symbol or prohibits certain characters in some positions, the simple power formula does not count the constrained space exactly. Likewise, passphrases selected from a word list should use the list size as the number of choices and the number of independently selected words as the length. A large combination count does not directly state how long an attacker needs. Guessing speed varies dramatically with password hashing, hardware, rate limits, account lockouts, and whether an attack is online or against a stolen hash. Attackers also prioritize likely human choices instead of checking strings in random order. Use this result to compare idealized search spaces, not to promise a specific cracking time. For practical security, generate unique random passwords, use multifactor authentication, and store passwords only with a modern salted password-hashing algorithm.

Password combination examples

These examples assume every string in the stated character set is equally possible.

Password formatPossible combinationsTheoretical entropy
6 digits; 10 choices per position1,000,00019.93 bits
8 lowercase letters; 26 choices208,827,064,57637.60 bits
12 alphanumeric characters; 62 choices3.2263e+2171.45 bits

How to calculate password combinations

  1. Enter the total number of positions in the password.
  2. Enter the number of characters that can be used in each position, or choose a preset.
  3. Select Calculate combinations to compute the search space and entropy.
  4. Compare the theoretical result with the randomness of the actual password-generation method.

Frequently asked questions

How are password combinations calculated?

Raise the number of available characters to the power of the password length. This works when every position permits the same independent set of characters.

What is password entropy?

Entropy expresses the search space in base-two bits. It estimates unpredictability only when choices are independent and uniformly random.

Do special characters always make a password stronger?

They enlarge the theoretical character set, but predictable placement or substitutions add less security than the formula suggests. Additional random length is usually more valuable than a familiar pattern.

Does this calculator estimate cracking time?

No. Cracking time also depends on hashing cost, attacker hardware, rate limiting, and guess order, so a combination count alone is insufficient.

Can I use this for a random passphrase?

Yes, if each word is selected independently from a fixed list. Use the list size as available choices and the number of words as the length.