Phase 1: Prepare
Step 1 Warm-up recall
From M8.L1: why do packets carry a number?
Private: nothing you type here is sent or stored.
Step 2 Learning goal
By the end of this lesson you can:
- state three security goals (Foundation);
- calculate possible passwords (Core);
- apply and criticise a Caesar cipher (Core).
Phase 2: Teach
Step 3 A familiar example
A lock has to stop the wrong people, let the right people in and still work. Security in computing has three goals in the same spirit.
Step 4 Clear explanation
Security aims at three goals.
| Security goal | Meaning | Example of failure |
|---|---|---|
| Confidentiality | Only the right people can read the data | A stranger reads your messages |
| Integrity | The data has not been changed wrongly | A bank balance is altered |
| Availability | The data and service can be used when needed | A site is knocked offline |
One defence is a strong password. The number of possible passwords of a given pattern is the number of choices per place, multiplied together for every place. With 26 lowercase letters, a password of 4 letters has 26 × 26 × 26 × 26 = 456,976 possibilities.
| Password pattern | Number of possible passwords |
|---|---|
| 4 digits | 10,000 |
| 4 lowercase letters | 456,976 |
| 6 lowercase letters | 308,915,776 |
| 8 lowercase letters | 208,827,064,576 |
Each extra letter multiplies the count by 26, which is the same exponential growth met in Module 5. Longer passwords therefore help far more than small tricks. Real systems add other protections, such as limiting attempts, and the table counts possibilities only.
Another defence is encryption: scrambling data so only someone with the right key can read it. A Caesar cipher shifts each letter along the alphabet by a fixed number.
It shows the idea, but it is not secure: there are only 25 possible shifts, so anyone can try them all in moments. Real encryption uses methods with astronomically many possible keys. Trying every key is the same “check everything” approach that exponential growth makes impractical.
Step 5 Worked example (4 marks)
Encrypt CAT with a Caesar shift of 1.
- C moves one place to D. (1 mark)
- A moves one place to B. (1 mark)
- T moves one place to U. (1 mark)
- Answer: DBU. (1 mark)
Phase 3: Practise
Step 6 Learner practice (instant-marked)
1. Confidentiality means:
It is about who can read.
2. The number of 4-digit passwords is:
10 × 10 × 10 × 10.
3. Adding one lowercase letter to a password multiplies the count by:
There are 26 choices for the new place.
4. A Caesar cipher is weak because:
An attacker can try them all.
Phase 4: Close
Step 7 Recap
- Confidentiality, integrity and availability are the three goals.
- Possible passwords multiply by the number of choices per place.
- A Caesar cipher is easily broken.
Step 8 Exit ticket (ungraded)
Encrypt ZOO with a Caesar shift of 1.
Private: nothing you type here is sent or stored.
Step 9 Go further (Extension)
Count the possible 5-letter lowercase passwords by multiplying out 26 five times.
Common mistakes
| Mistake | Why it fails |
|---|---|
| Adding, not multiplying, the choices per place | Multiply the choices for each place. |
| Treating a Caesar cipher as real security | It is a classroom example. |
| Forgetting availability as a goal | A service that is down has failed. |
Limits. Counts show only how many possibilities exist; real attackers use other methods, so a long password is necessary but not sufficient.