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
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
190 CHAPTER 10. TRANSPOSITION CIPHERS<br />
10.2 Geometrical Ciphers<br />
Traditionally, the most common way <strong>of</strong> using transposition was to arrange the<br />
plaintext letters in some sort <strong>of</strong> rectangle. When the insertion and reading <strong>of</strong><br />
the letters is done in patterns other than rows and columns, we call the ciphers<br />
Geometrical Ciphers.<br />
Examples: Decipher the geometrical ciphers.<br />
(1) Decipher ANOOR RDXOA OWEOD UNDAN. (Write in 4 rows and read <strong>of</strong>f in a<br />
spiral.)<br />
(2) Decipher IINIZ ATGDZ MTVYY GEERX.<br />
(3) Decipher MOGIN VNNOA IAGLI DAIRC ISTKY. 2<br />
⋄ ⋄ ⋄ ⋄ ⋄ ⋄ ⋄ ⋄ ⋄ ⋄ ⋄ ⋄<br />
10.3 Turning Grilles<br />
A grille is simply a piece <strong>of</strong> paper in which holes have been cut. To encipher, lay<br />
the grille on a clean sheet <strong>of</strong> paper, write your message in the holes, and, once<br />
finished, remove the grill and fill in the leftover spaces with nulls. Deciphering<br />
is easy – lay the grille back on the ciphertext to see the meaningful letters.<br />
Giacolomo Cardano, last seen in Chapter 8.8.4 apparently invented this method<br />
in the 16th century. The problem with this method is that to be secure there<br />
must be many nulls, maybe up to half, and this makes the ciphertext long in<br />
relation to the plaintext. To reduce the number <strong>of</strong> nulls, we need to be more<br />
careful about where we put the holes. 3<br />
<strong>St</strong>art with a piece <strong>of</strong> paper that has a grid marked on it. (A grid here simply<br />
meaning a series <strong>of</strong> horizontal and vertical lines that visually divides the paper<br />
into equal sized squares.) Select some 2n × 2n collection <strong>of</strong> these small squares<br />
that forms a large square and divide it into four n × n squares. Fill up the<br />
upper left-hand sub-square with the numbers 1 through n 2 with 1 through n<br />
on the top row, etc.. Then turn your paper one-quarter <strong>of</strong> the way around and<br />
similarly fill the new upper left-hand square with 1 through n 2 . Repeat this<br />
process twice more, so that each <strong>of</strong> the numbers is repeated four times in the<br />
big square.<br />
Next, pick exactly one <strong>of</strong> the four copies <strong>of</strong> each <strong>of</strong> the numbers and highlight<br />
or circle it. It’s best if you pick about the same number <strong>of</strong> numbers from each <strong>of</strong><br />
the small squares. Take a new sheet <strong>of</strong> paper and, using the old as a reference,<br />
2 (1) around and around we go, (2) Read <strong>of</strong>f going down and up the columns: i am<br />
getting very dizzy, (3) Read <strong>of</strong>f the diagonals: moving in a diagonal is tricky.<br />
3 To be precise, the Cardano method actually produces a open cipher rather than a<br />
transposition, but we aren’t that precise.