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.
120 CHAPTER 7.<br />
VIGENÈRE CIPHERS<br />
Our eyes should be sufficiently trained by this point to detect the five Caesar<br />
ciphers here. For example, the first two have the following fit:<br />
First letters:<br />
plain: o p q r s t u v w x y z a b c d e f g h i j k l m n<br />
4 0 1 1 3 4 0 0 1 0 3 0 2 1 2 2 4 4 1 0 0 1 0 2 2 3<br />
cipher: 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 Key is M.<br />
Second letters:<br />
plain: 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 />
3 0 2 2 1 3 3 2 1 0 1 1 1 2 1 0 1 3 0 2 1 3 1 4 2 1<br />
cipher: 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 Key is A.<br />
The other three letters <strong>of</strong> the keyword are quickly determined. (Do it!) 13<br />
⋄ ⋄ ⋄ ⋄ ⋄ ⋄ ⋄ ⋄ ⋄ ⋄ ⋄ ⋄<br />
This example shows that if we can determine the length <strong>of</strong> the keyword <strong>of</strong> a<br />
Vigenère cipher, the difficult work will be done, because breaking the Vigenère<br />
cipher will be the same as breaking several Caesar ciphers. In other words, a<br />
bit time-consuming, but pretty easy.<br />
This is actually where Linquist’s method becomes useful. If one has a complete<br />
Caesar cipher, running down the alphabet is a quick and simply-minded<br />
<strong>of</strong> decrypting it. But when working on a Vigenère cipher we do not have consecutive<br />
groups <strong>of</strong> letters, and so running down the alphabet looking for words<br />
will not work. Further, there will be cases in which each group <strong>of</strong> similarlyencrypted<br />
letters is quite small, making traditional frequency analysis hard.<br />
Linquist’s method, however, is designed with small groups <strong>of</strong> letters in mind,<br />
and will sometimes be helpful.<br />
7.7 The Kasiski Test<br />
Friedrick W. Kasiski (1805–81) was born in what is now Poland, entered East<br />
Prussia’s Infantry in 1823 and retired 1852. In 1863 he published Die Geheimschriften<br />
und die Dechiffrir-kunst, a book <strong>of</strong> only 95 pages. After his book<br />
made no apparent impact, he quit cryptography and became an anthropologist<br />
<strong>of</strong> some local fame. His book contained a method for determining the number <strong>of</strong><br />
letters in a Vigenère keyword, and by the beginning <strong>of</strong> the 20th century experts<br />
considered polyalphabetic ciphers to be vulnerable.<br />
13 The key is MARCEL and the plaintext is “Encode well or do not encode at all. In transmitting<br />
cleartext, you give only a piece <strong>of</strong> information to the enemy, and you know what it is; in<br />
encoding badly, you permit him to read all your correspondence and that <strong>of</strong> your friends.”<br />
General Marcel Givierge, head <strong>of</strong> French cryptology during WWI, author <strong>of</strong> Course de<br />
Cryptographie, 1925. [Kahn, pg 349]