Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
Kwame intercepts a message made with a shift cipher. He does not know the key, so he tries every key, one after another, and reads the result each time. Each try takes him seconds.
Data can be intercepted on a network. Encryption turns plaintext into ciphertext with an algorithm and a key, so intercepted data is meaningless without the key; it does not stop interception. In a shift cipher, with A to Z , the rule is .
Have you tried it?
Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.
Step 1. The keys. The keys to each shift the letters differently. Key (or ) changes nothing. So there are useful keys.
Step 2. The longest time. In the worst case he tries all of them: .
Step 3. What it shows. Trying every key is called a brute-force attack. Here it takes under a minute by hand, and no time at all for a computer. A safe method needs so many possible keys that trying them all is impossible.
Answer: (a) . (b) . (c) The shift cipher is far too weak: it has too few keys.
Log in to join the discussion.
Loading…