Concept 1 of 71 min
Passwords, brute force and second factors
Brute force on short passwords
| Symbols | 36 |
|---|---|
| Guesses | 1,000,000,000/s |
| Short | 6 characters |
| Medium | 8 characters |
| Long | 10 characters |
- 6 characters: 366 ÷ 1,000,000,000 ≈ 2.18
- 8 characters: 368 ÷ 1,000,000,000 ≈ 2,821
- Each 2 more: 362 = 1,296 times
- 10 characters ≈ 2,821 × 1,296 ≈ 3,656,000
About 42 days for 10 characters against 2.18 seconds for 6: length beats complexity rules.
- 1,000,000,000 guesses a second
The search space is the alphabet size to the power of the length, so each extra character multiplies the attacker's work. A hardware security key (FIDO2) resists phishing better than codes, and credential stuffing is stopped by throttling and MFA (multi-factor authentication).
After a breach, attackers guess offline at billions of fast hashes a second; a hash designed to be slow makes each guess far dearer. Length beats complexity rules for strength.
A security key checks the real site's domain, so a look-alike page gets nothing, while codes from SMS (Short Message Service) or an app can be typed into a fake page and relayed.
Credential stuffing replays real passwords leaked elsewhere, so longer length rules do not help; throttling, second factors and rejecting known-breached passwords do.
- Storing passwords with SHA-256.
- Relying on complexity rules instead of length.
- Treating SMS codes as phishing-proof.
You are designing the login of a new client portal for a bank. What would you put in place?
A complete answer covers
- Store passwords with a slow, salted hash such as Argon2.
- Offer phishing-resistant second factors, such as security keys or passkeys.
- Throttle attempts and reject passwords known from breaches.
- Alert on unusual logins: new device, country or time.
Also in our technical interviews, on camera, with a score.
Concept 2 of 71 min
Hashes: salts, one-way functions and checksums
The why, the charts, the worked example and the interview questions are in Essentials, with every quiz.
See the plansSign inConcept 3 of 71 min
Encryption, TLS, certificates and keys
The why, the charts, the worked example and the interview questions are in Essentials, with every quiz.
See the plansSign inConcept 4 of 71 min
Web flaws: injection, XSS, CSRF and access control
The why, the charts, the worked example and the interview questions are in Essentials, with every quiz.
See the plansSign inConcept 5 of 71 min
How attackers go after banks
The why, the charts, the worked example and the interview questions are in Essentials, with every quiz.
See the plansSign inConcept 6 of 71 min
Defence: privilege, zero trust, patching, detection and response
The why, the charts, the worked example and the interview questions are in Essentials, with every quiz.
See the plansSign inConcept 7 of 71 min
AdvancedHow a slow hash turns hours of cracking into years
The why, the charts, the worked example and the interview questions are in Essentials, with every quiz.
See the plansSign inRecap
- Passwords: slow, salted hashes such as bcrypt or Argon2; length multiplies the search space; phishing-resistant keys beat codes.
- A hash is one-way and checks integrity; encryption is reversible with a key, which must live apart from the data.
- Parameterised queries stop SQL injection, output encoding stops XSS, tokens stop CSRF (cross-site request forgery), and every request checks ownership.
- Urgent, secret payment requests are verified on a known channel; backups attackers cannot reach beat ransom.
- Least privilege, zero trust, patch what is exploited and exposed first, and isolate an infected machine before anything else.
25 questions on Cyber security
Timed, like the real one, drawn from a bank of 33. Every answer explained.