Notes: Thursday 20 January 2005

Assignments Due
Sunday, 23 January (11:59pm)	Registration Survey
Thursday, 3 February	Problem Set 1

Mailing Lists
Students in CS588 are encouraged to subscribe to these mailing lists:

• RISKS - can be read web, or send a message to risks-request@csl.sri.com with first line SUBSCRIBE.
• Crypto-gram Newsletter (monthly); to subscribe visit http://mailapp.modwest.com/mailman/listinfo/crypto-gram-list

Readings

Reading (for PS1):

• Richard Feynman. Safecracker Meets Safecracker. From "Surely You're Joking, Mr. Feynman!: Adventures of a Curious Character", Richard P. Feynman (Ralph Leighton), Norton 1985.
• Mao, Chapter 1, 2, 3 (except 3.6 which we will cover later), 7.1-7.5.

Cryptogram

XBW HGQW XS ACFPSUWG FWPGWXF CF AWWKZV CDQGJCDWA CD BHYJD DJXHGW; WUWD XBW ZWJFX PHGCSHF YCDA CF GSHFWA LV XBW KGSYCFW SI FBJGCDQ RDSOZWAQW OCXBBWZA IGSY SXBWGF.

Questions

• Why is computer security important?
• Terms: cryptology, cryptography, cryptanalysis, steganography, encryption, decryption, plaintext, ciphertext
• What is the reasoning behind Kerchoff's principle?
• What is the difference between symmetric and asymmetric cryptosystems?
• What is a monoalphabetic cipher? How can one break a monoalphabetic cipher?
• What are the different types of attacks (and their relative power) on a cryptosystem?
• What is a one-time pad? How secure is a one-time pad?

There is a remarkably close parallel between the problems of the physicist and those of the cryptographer. The system on which a message is enciphered corresponds to the laws of the universe, the intercepted messages to the evidence available, the keys for a day or a message to important constants which have yet to be determined. The correspondence is very close, but the subject matter of cryptography is very easily dealt with by discrete machinery, physics not so easily.

Alan Turing

University of Virginia Department of Computer Science CS 588: Cryptology - Principles and Applications

cs588–staff@cs.virginia.edu