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

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

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

192 CHAPTER 10. TRANSPOSITION CIPHERS<br />

Do this twice more. Since the plaintext has only 31 letters we add five<br />

nulls letters at the end. (I chose stopt as the nulls.) Then pull <strong>of</strong>f the<br />

ciphertext in rows and regroup.<br />

(2) Decipher UTOWL MHHDE IAFTO NADOG MBIHD OEAEU CNCOS Y using the same<br />

grille. 4<br />

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

For about four months in 1917 the German Army used Turning Grilles. (The<br />

German Army was quite lost, cryptographically, during much <strong>of</strong> World War I,<br />

and tried just about every method they could get their hands on.) ANNA was<br />

5 × 5, BERTA was 6 × 6, all the way up to FRANZ, who was 10 × 10. The<br />

French, who were crytologically far more advanced than the Germans, treated<br />

Anna, Berta and Franz as old friends, and happily read most <strong>of</strong> the messages<br />

sent in this manner.<br />

10.4 Columnar Transposition<br />

Columnar transposition is the transposition method. It was widely used,<br />

especially in World War I, and fell out <strong>of</strong> favor only because <strong>of</strong> the rise <strong>of</strong><br />

machine ciphers. 5<br />

To encipher, pick a keyword and write the message under the keyword in<br />

rows with as many columns as letters in the keyword. Number the columns<br />

alphabetically from the code word, just as in the keyword transposed ciphers<br />

from Section 1.5.3. (Remember we decided to consecutively number repeated<br />

letters, so REPEATER is numbered 62531847.) Then pull the columns out oneby-one<br />

in this numerical order. Separate the letters into groups <strong>of</strong> five and you<br />

have enciphered your message. (It is possible that your message will not make<br />

a perfect rectangle. That is fine. Either ignore the blanks, or fill them with<br />

nulls.)<br />

To decipher the message we need to know not only what the proper ordering<br />

<strong>of</strong> the the columns is (which we do, as we know the keyword), but also how<br />

many letters go into each column. Suppose we have a message N letters long,<br />

and the keyword has k letters. <strong>St</strong>art by drawing a rectangle with k columns.<br />

Next divide the columns into rows. There will be N ÷ k full rows (here N ÷ k<br />

means this integer part <strong>of</strong> division), and a final row that will contain N%k<br />

letters at its beginning and be blank at the end. Cross out these blank spaces<br />

so you won’t be tempted to put letters into them. Now put in your ciphertext<br />

4 (1) MACGA IRITA DHNER ASOMN TALOO OWMTP SOIAT C. (2) who did anything he could to<br />

become famous, (which is true about Cardano, as his biographers can attest.)<br />

5 Machine ciphers are clearly much faster than ciphering by hand. Further, since transposition<br />

generally deals with large groups <strong>of</strong> letters at one, as opposed to substitution which<br />

enciphers small groups at once, the early limits on computer memory made pure transposition<br />

machine-ciphers less secure than substitution machine-ciphers.

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

Saved successfully!

Ooh no, something went wrong!