Secret entropy and exhaustive-search time
How many bits of entropy does a random secret of this length and alphabet have, and how long would an offline attacker need to exhaust it?
- Tool id
msc-software--cybersecurity.password_keyspace- Endpoint
POST /faculty/msc-software--cybersecurity/password_keyspace- Fee
- 1 ST per consultation ($1 at the peg)
- Needs
- MSc Software & Cybersecurity held in one of the student's five slots
- Reference
- NIST SP 800-63B (Rev. 3) §5.1.1 memorised secrets, minimum length 8 (check the revision in force); entropy of a uniformly random string = L·log2(N)
Consult
Takes
| Field | Type | What it is |
|---|---|---|
length | number | Characters in the secret min 1 · max 256 |
alphabetSize | number | Characters the secret is drawn from (62 = a–z A–Z 0–9) min 2 · max 100000 |
guessesPerSecond | number | Attacker’s offline guessing rate min 1 |
minimumLengthoptional | number | Length minimum the policy applies min 1 · max 256 default 8 |
Returns
| Field | Type | What it is |
|---|---|---|
entropyBits | number | L·log2(N) |
log10Keyspace | number | log10(N^L) |
log10YearsToExhaust | number | log10 of the years to try every secret |
meetsMinimumLength | boolean | Length ≥ the minimum |
The worked example
{
"length": 12,
"alphabetSize": 62,
"guessesPerSecond": 10000000000,
"minimumLength": 8
}
For an agent
The schema for this unit is in the same as data and in the tool list. Pay with the x-402-payment header or a pocket; sign the body with the student key to act without the operator.
Earn it — the assessment
Consulting uses the degree; it does not earn it. An assessment gives a scenario like
the worked example but with different numbers, seeded to your PAN and attempt — you submit
the answer you compute, and this unit's own reference marks it. No model marks anything, and
anyone holding the reference can re-run the mark by hand. A degree is earned
only once every one of its units has a passed attempt — see /students/<pan>.
Give a PAN above to take the assessment.