30.11.2012 Views

Code and ciphers: Julius Caesar, the Enigma and the internet

Code and ciphers: Julius Caesar, the Enigma and the internet

Code and ciphers: Julius Caesar, the Enigma and the internet

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

42<br />

chapter 4<br />

Cryptanalytic attack<br />

Simple though it is, a transposition cipher may not be easy to solve. A frequency<br />

count of <strong>the</strong> individual letters (‘monographs’) will reveal that <strong>the</strong>y<br />

have not been changed but <strong>the</strong> frequencies of pairs of letters (‘digraphs’)<br />

such as TH, HE <strong>and</strong> QU will be different from what would be expected in<br />

an English text. The cryptananlyst would <strong>the</strong>refore suspect that a transposition<br />

system is being used <strong>and</strong> his first task in trying to solve it would<br />

be to determine <strong>the</strong> length of <strong>the</strong> key.<br />

Since <strong>the</strong> message above is 35 letters in length all 7 groups have 5<br />

letters. The cryptanalyst would not know whe<strong>the</strong>r <strong>the</strong> message was genuinely<br />

35 letters in length or had been ‘padded out’ with some ‘dummy<br />

letters’ in order to produce full cipher groups, all of which have 5 letters.<br />

In ei<strong>the</strong>r case however he has a possible clue as to <strong>the</strong> length of <strong>the</strong> key.<br />

Since 35�5�7 it is worth looking at <strong>the</strong> cipher text on <strong>the</strong> assumption<br />

that <strong>the</strong> key is of length 5 or 7. He is making <strong>the</strong> assumption that <strong>the</strong><br />

transposition box is ‘regular’, i.e. that all <strong>the</strong> columns are of equal length;<br />

<strong>the</strong>y may not be, but this is a reasonable first step.<br />

Assuming that <strong>the</strong> key is of length 5, two letters which were adjacent<br />

in <strong>the</strong> original message will be 7, 14, 21 or 28 positions apart in <strong>the</strong> cipher<br />

text unless one of <strong>the</strong> pair was at <strong>the</strong> end of one row <strong>and</strong> <strong>the</strong> o<strong>the</strong>r was at<br />

<strong>the</strong> beginning of <strong>the</strong> next. The cryptanalyst would <strong>the</strong>refore write out <strong>the</strong><br />

cipher text in 5 columns of 7 letters, which has <strong>the</strong> effect of giving letters<br />

which were next to each o<strong>the</strong>r in <strong>the</strong> plaintext a good chance of being in<br />

<strong>the</strong> same row of <strong>the</strong> cipher text arranged in this way. Using this arrangement<br />

<strong>the</strong> cipher text becomes as shown in Table 4.2.<br />

Table 4.2<br />

E T M I E<br />

G I N L W<br />

B O L N E<br />

R D F A I<br />

A E Y L T<br />

V N E T E<br />

I T H Y R<br />

The next step is to look at <strong>the</strong> various pairs of letters in each row to see<br />

which of <strong>the</strong>m look to be <strong>the</strong> most likely digraphs. For this purpose access<br />

to a frequency count of digraphs in English, such as can be found in <strong>the</strong><br />

Brown corpus <strong>and</strong> in some books on cryptography, is a great help. In <strong>the</strong>

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!