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.4. LINQUIST’S METHOD 21<br />

the ciphertext. In this example, the only letters occurring more than once are<br />

A, P and T, twice each, and M, which appears three times. Even for such a short<br />

message (when the frequencies can be quite messed up) it many <strong>of</strong> these letters<br />

must come from etaoinshr. Linquist’s idea is to see if there is one shift amount<br />

that would produce all or most <strong>of</strong> the most common ciphertext letters from the<br />

common plaintext letters.<br />

To do this, make a chart with the common plaintext letters across the top<br />

and common ciphertext letters down the side. For each <strong>of</strong> the etaoinshr letters<br />

determine what key produces the ciphertext letter from this plaintext letter. For<br />

instance, e must be shifted by 22 letters to become A, so we enter 22 in the e-th<br />

column and A-th row. To find the shift amount using the Saint Cyr slide, line up<br />

A under e and then see what the key is. Similarly, lining up M under e produces<br />

an 8, so 8 is the second entry in the first column.<br />

e t a o n i r s h<br />

A 22 7 0 12 13 18 9 8 19<br />

M 8 19 12 24 25 4 21 20 5<br />

P 11 22 15 1 2 7 24 23 8<br />

T 15 0 19 5 6 11 2 1 12<br />

We are looking for one shift amount that would cause four <strong>of</strong> etaoinshr to<br />

become AMPT. So we are searching for numbers that appear in every row, or,<br />

failing that, occur in at least in three <strong>of</strong> the four rows. No number appears in<br />

each row, but 8, 12 and 19 appear in appear in three <strong>of</strong> the four rows. It is most<br />

likely that one <strong>of</strong> these three is the proper shift amount. We simply decipher<br />

the message using each to see which one it is. 16<br />

Example: Decrypt WZRVM ZOCSD YZNGA HVMXC using Linquist’s method.<br />

The only letters than appear more than once are C, M, V and Z, so our chart<br />

is set up as<br />

e t a o n i r s h<br />

C 24 11<br />

M 19 4<br />

V 8 3<br />

Z 25 17<br />

Some <strong>of</strong> the chart has been filled in for you. Complete it, find the most common<br />

letter (i.e., the possible keys) and try them to determine the key. Finally,<br />

decipher the message. 17<br />

⋄<br />

16 It is 8. Deciphering gives Rome has seven hills.<br />

17 Beware the Ides <strong>of</strong> March, key = 17.

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

Saved successfully!

Ooh no, something went wrong!