06.01.2015 Views

Cryptology - Unofficial St. Mary's College of California Web Site

Cryptology - Unofficial St. Mary's College of California Web Site

Cryptology - Unofficial St. Mary's College of California Web Site

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

1.3. FREQUENCY ANALYSIS 17<br />

A bit more concretely, a, e and i form a set <strong>of</strong> high frequency letters 4 steps<br />

or letters apart. Next, hi and no are high pairs and rst a high triplet. Finally,<br />

uvwxyz is a set <strong>of</strong> six very low values that directly follows the rst triplet and<br />

occurs directly before a.<br />

To see how these patterns are used let’s look at an example.<br />

Example: Use frequency analysis to decrypt YPYH NBCM MBILN GYMMUAY XIYM<br />

HIN LYGUCH MYWLYN ZIL FIHA.<br />

We first construct a frequency chart by counting the number <strong>of</strong> times each<br />

letter appears:<br />

ciphertext<br />

\ \ \<br />

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z<br />

The most common letters are M and Y, so one <strong>of</strong> these is probably e. (Of<br />

course, e might instead be N, H or L, but these are less likely.) If M were e,<br />

we’d expect to find the aei-triple <strong>of</strong> high counts separated at intervals <strong>of</strong> four<br />

at IMQ. There are several I’s, but no Q’s. Worse, H would be z, and four z’s is<br />

unlikely. On the other hand, if Y were e, the aei-triple would be at UYC. This<br />

message is very short, so a “high”-triple is not all that high, and so UYC might<br />

be reasonable fit for aei.<br />

Where might rst fit The highest consecutive triple is at LMN. This fits<br />

pretty well, since the low septet uvwxyz would fit at OPQRST. Finally, just before<br />

LMN is a high pair HI, so we might guess that HI is no.<br />

Putting this plaintext guess above the frequency chart will help us see if<br />

everything fits:<br />

plaintext<br />

ciphertext<br />

g h i j k l m n o p q r s t u v w x y z a b c d e f<br />

\ \ \<br />

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z<br />

The fit is good – the peaks at e, no, and rst, and the long valley at uvwxyz give<br />

us confidence we’ve done this correctly. Finally, the keyletter is the ciphertext<br />

letter that a becomes, so the key is U. Now we simply decipher to find that the<br />

message is Even this short message does not remain secret for long.<br />

⋄ ⋄ ⋄ ⋄ ⋄ ⋄ ⋄ ⋄ ⋄ ⋄ ⋄ ⋄<br />

A message’s frequency chart will seldom have all <strong>of</strong> the patterns, but it<br />

should have good evidence <strong>of</strong> several. When trying to fit the patterns generally<br />

we start with the tallest peaks <strong>of</strong> e and t, and the long low valley <strong>of</strong> uvwxyz.<br />

Then we look for the aei and rst triples. Finally, we see if the no pair is present.<br />

If there are several “probably”’s when trying to fit these patterns, then the key<br />

likely is the ciphertext letter posing as a. Try this possible key by deciphering<br />

ten or so letters from the ciphertext. If a message seems to be appearing, we’ve

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

Saved successfully!

Ooh no, something went wrong!