Model for Random Search Time
Estimate average time for exhaustive search from random search space wey you assume.
Your numbers
Expected time for rate wey you enter
Uniform search-space model only. Real password guessing, online rate limits, hash cost, parallel work and compromise risk fit differ well well.
Compare scenarios
You fit keep up to three snapshots for this tab. Loading one go replace the present inputs.
Formula
Use t ≈ 2^(b−1)/g. b na search-space entropy for bits, g na assumed guesses per second, and t na expected search time for seconds.
Estimate average time for exhaustive search from random search space wey you assume.
Example wey show the calculation
- Entropy of random search space (bits)
- 40
- Guesses for each second wey you assume
- 1000000
- Expected time for rate wey you enter
- 549,755.813888 seconds
- Time to search everywhere for worst case
- 1,099,511.62778 seconds
Where e fit work and limits
Uniform search-space model only. Real password guessing, online rate limits, hash cost, parallel work and compromise risk fit differ well well.
We check inputs for missing values and allowed ranges. Result wey pass the finite numeric range no go show. Rounding affect wetin display, while calculation use the model numeric precision.
Check your units and assumptions before you rely on result. Changing label no convert currency or physical unit.
Version of di formula: cd920a000532 · Example don get check: