Password Combination Calculator
Find the number of possible passwords and theoretical entropy from password length and character-set size.
About password combinations
Password combination examples
These examples assume every string in the stated character set is equally possible.
| Password format | Possible combinations | Theoretical entropy |
|---|---|---|
| 6 digits; 10 choices per position | 1,000,000 | 19.93 bits |
| 8 lowercase letters; 26 choices | 208,827,064,576 | 37.60 bits |
| 12 alphanumeric characters; 62 choices | 3.2263e+21 | 71.45 bits |
How to calculate password combinations
- Enter the total number of positions in the password.
- Enter the number of characters that can be used in each position, or choose a preset.
- Select Calculate combinations to compute the search space and entropy.
- 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.