Calculator Inputs
Example Data Table
| Case | Charset Size | Length or Space | Guess Rate | Approximate 50% Time |
|---|---|---|---|---|
| 4-digit PIN | 10 | Length 4 | 1,000/s | About 5 seconds |
| Lowercase password | 26 | Length 8 | 100,000/s | About 24 days |
| Mixed letters and digits | 62 | Length 10 | 1e9/s | About 13 years |
| Direct custom keyspace | Not needed | 1e15 combinations | 1e8/s | About 58 days |
Formula Used
C = lowercase + uppercase + digits + symbols + spaces + custom characters
K = CL
Ktotal = Σ Cn, for n from minimum length to maximum length
Reffective = base guess rate × parallel factor × efficiency
T = target guesses ÷ Reffective, where target guesses = Ktotal × target success fraction
Best case uses one guess, average case uses half the space, and worst case uses the full search space.
How to Use This Calculator
- Choose whether you want to build the keyspace from character sets or enter a direct keyspace value.
- If using character sets, select the groups you want and enter minimum and maximum lengths.
- Set the base guesses per second to match your search hardware or attack model.
- Use the parallel factor to simulate multiple devices or threads searching together.
- Adjust efficiency when real-world performance is lower than the theoretical maximum.
- Choose a target success percent, then submit the form to see summary metrics, the result table, and the graph.
FAQs
1. What does this brute force estimator measure?
It estimates how many guesses an exhaustive search needs and how long that search may take at a chosen attempt rate. It helps study PINs, passwords, keys, and other combinatorial search problems.
2. Why is the graph shown on a log10 scale?
Brute force times can grow from fractions of seconds to billions of years. A log10 scale keeps those values readable and makes scenario comparisons much clearer.
3. What is the difference between average and worst case?
Worst case assumes the correct answer is found last. Average case assumes the answer appears halfway through the search. Best case assumes it is found immediately.
4. When should I use direct keyspace mode?
Use direct mode when you already know the total search space. This is helpful for theoretical studies, non-text problems, or precomputed combinatorial counts.
5. Does this calculator include lockouts or rate limits?
No. The model assumes uninterrupted exhaustive search. Account lockouts, throttling, salts, memory-hard functions, and protocol overhead can make real attacks much slower.
6. What does efficiency mean here?
Efficiency lets you reduce the ideal hardware rate to a more practical value. For example, 80% efficiency means your real search runs at only eighty percent of the theoretical speed.
7. Why does adding one character to length matter so much?
Because the search space grows exponentially. Each extra position multiplies the total number of combinations by the charset size, which can dramatically increase the expected search time.
8. Can I use this for educational mathematics work?
Yes. It is useful for counting principles, exponentials, geometric sums, growth rates, and numerical modeling. It works well in maths, probability, and algorithm-analysis exercises.