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.
146 CHAPTER 8. POLYALPHABETIC CIPHERS<br />
fails with such few letters. 9<br />
How can we make such long keywords One way would be to use phrases,<br />
or paragraphs from agreed upon books. This works well, but becomes harder<br />
to remember. Apparently, when people write to the National Security Agency<br />
(NSA), the cryptographic arm <strong>of</strong> the US Government, saying “I’ve discovered<br />
a great new and unbreakable code for you to use”, this is most frequently the<br />
method they describe. 10<br />
Another method we will call the Double Vigenère. We carefully pick two<br />
keywords and encipher the message twice, using each keyword once.<br />
Examples:<br />
(1) Encipher aaaaaaaaaaaaaa. First use the keyword IT and then re-encipher<br />
with the keyword WAS.<br />
plaintext a a a a a a a a a a a a a a a a a a a a<br />
key 1 I T I T I T I T I T I T I T I T I T I T<br />
partial ciphertext I T I T I T I T I T I T I T I T I T I T<br />
key 2 W A S W A S W A S W A S W A S W A S W A<br />
ciphertext E T A P I L E T A P I L E T A P I L E T<br />
IT and WAS act like a 6-letter keyword!<br />
(2) Encipher banana banana banana banana using LAKE and then OCEANS.<br />
How long is the combination keyword 11<br />
⋄ ⋄ ⋄ ⋄ ⋄ ⋄ ⋄ ⋄ ⋄ ⋄ ⋄ ⋄<br />
What is the pattern How long a “keyword” does the use <strong>of</strong> two keywords<br />
produce The combination keyword will start to repeat whenever each individual<br />
keyword starts to repeat. The last letter enciphered before this repetition<br />
starts must be enciphered with the last letter <strong>of</strong> each keyword. So each keyword<br />
has repeated some number <strong>of</strong> times up to this point. The number <strong>of</strong> letters<br />
enciphered so far must then be a multiple <strong>of</strong> each keylength, and so the smallest<br />
multiple <strong>of</strong> each is when this first occurs.<br />
The smallest multiple <strong>of</strong> each has a formal name, the least common multiple<br />
or lcm. These Double Vigenère ciphers act like a single Vigenère cipher<br />
whose keyword is as long as the least common multiple <strong>of</strong> the original keywords.<br />
9 Another way to strengthen the polyalphabetic ciphers would be to avoid Caesar ciphers<br />
as the components but instead use better mixed alphabets. We will look at this in Exercise<br />
8.10.<br />
10 This method was first discovered in the 1500’s by Giacolomo Cardano. He, however,<br />
started the key over each time for each word in the message. Cardano is best remembered in<br />
mathematics for discovering – or stealing, depending on whose version <strong>of</strong> history you believe<br />
– the cubic formula (like the quadratic formula but for equations <strong>of</strong> degree three).<br />
11 They act like a 12 letter keyword. ACBEL SZGCA KWACB ELSZG CAKW.