Password Entropy and Credential Stuffing, the Forced-Rotation Paradox and Least-Privilege Accounts for One-Person Firms: chapter answers
This book tests the sentence most common in small firms' security policies: passwords must change every 90 days and must contain four classes of character. It splits the sentence into two claims that data can overturn: forcing changes by the calendar, with no sign of compromise, brings no measurable security benefit and produces predictable variants; and randomly generated long passphrases beat complex short passwords that people assemble themselves. Its firms, accounts and probabilities are illustrative, and all calculations are generated by its programs; it is not personalised business, leg…
DOI pending · monograph page goes live after publication · 5DL-B-218 · 中文版
- Chapter 1 · The Forced-Rotation Paradox: Predictable Variants and an Overrated Attack Window
Chapter 1 shows that an attacker who needs one day of access still succeeds with probability 0.991 under a 90-day forced change, corrects the blueprint's "no longer recommends" to the "shall not" of Revision 4, and sets… - Chapter 2 · The Entropy Ledger: log2(N^L), Random Long Passphrases and Complex Short Passwords
Chapter 2 computes entropy: eight random printable characters carry 52.44 bits, four random words 51.70 and five random words 64.62, and human-chosen phrases cannot be scored by the formula. - Chapter 3 · Guessing under a Zipf Law: Why Shannon Entropy Overrates Human-Chosen Passwords
Chapter 3 shows in a Zipf population that a ten-guess success rate of 0.0477 is 817 times that of a uniform distribution with the same entropy; if refused users switch to predictable mutations, the hundred-guess rate un… - Chapter 4 · The Credential-Stuffing Funnel: Reuse Rates, Breach Corpora and Second Factors
Chapter 4 computes the stuffing funnel: ten accounts sharing one password expose 4.37 times as many accounts as unique passwords, and going from half to full second-factor coverage cuts residual risk 28.3 times. - Chapter 5 · Throttling, Blocklists and Hash Prefixes: the Ceiling on Online Guessing
Without the prefix, a single guess succeeds with the top candidate's probability, 0.0314. Knowing a one-character prefix raises it to 0.1240, 3.9 times; two characters give 0.3041, 9.7 times; three give 0.6214, 19.8 tim… - Chapter 6 · The Permission Graph and its Minimum Cover: a One-Person Firm's Blast Radius
Chapter 6 uses minimum role covers and the recovery graph to show that the illustrative firm expects to lose 0.4972 accounts a year, and 0.1899 after hardening the main mailbox alone. - Chapter 8 · The Permission-Matrix Audit Sheet: an Empirical Loop and a Falsification Plan
Chapter 8 gives the permission-matrix audit sheet and the tool of the same name: the illustrative firm's weighted residual risk index falls from 11.640 to 1.017; it also gives a pre-registered testing plan and the resul…
Illustrative model calculation, not a live quote