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.

8.8. TERMS AND TOPICS 155<br />

multiple <strong>of</strong> the lengths <strong>of</strong> the individual keys. While this method may keep<br />

short texts secure, the amount <strong>of</strong> keyword needed is directly related to the<br />

amount <strong>of</strong> text one wishes to send (approximately 1 page <strong>of</strong> keyword must be<br />

used to safely encipher 20 pages <strong>of</strong> plaintext). Producing and exchanging the<br />

huge <strong>of</strong> amount keys needed by a modern business or government prevents any<br />

practical use <strong>of</strong> a repeated Vigenère system.<br />

Vigenère did not invent the Vigenère Cipher, but, rather that Auto Key<br />

Cipher. This cipher uses a priming key following by the plaintext as its key,<br />

thus producing a key without repetitions. Its security is much better than that<br />

<strong>of</strong> the Vigenère. Nonetheless, the patterns in English provide enough <strong>of</strong> an entry<br />

that Friedman was eventually able to break this system.<br />

The only unbreakable cipher system is the One-Time Pad. A random series<br />

<strong>of</strong> letters (or numbers) is used as the key. As long as each key is used exactly<br />

twice, once for enciphering and once for deciphering, and is kept secret, the<br />

system cannot be broken. But the key is as long as the message, so the problem<br />

<strong>of</strong> transmitting the message is simply replaced by that <strong>of</strong> transmitting the key.<br />

So the immense quantity <strong>of</strong> keys that must be distributed to use this system<br />

prevent it from being used except in very special circumstances.<br />

8.8 Terms and Topics<br />

1. What is a “coincidence” What is the connection between coincidences<br />

and Kasiski’s test<br />

2. What is the Index <strong>of</strong> Coincidence What does it measure<br />

3. What is the formula for Φ<br />

4. How do the frequency counts <strong>of</strong> a monoalphabetic cipher and a polyalphabetic<br />

cipher with long keylength differ<br />

5. What does M.R. stand for What does it measure<br />

6. Under what circumstances do we expect M.R. to be a larger number A<br />

smaller number<br />

7. What is the Friedman test<br />

8. How can we use Φ to estimate the keylength <strong>of</strong> a polyalphabetic cipher<br />

9. What is the Double Vigenère How does it differ from the Vigenère cipher<br />

10. Performing multiple encipherments with different keywords is equivalent<br />

to enciphering once with a keyword <strong>of</strong> what length<br />

11. Who invented the Auto Key cipher<br />

12. What is the Auto Key cipher Explain how to use it.

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

Saved successfully!

Ooh no, something went wrong!