HW0. First handout from class
HW1. Second handout from class
HW1a. Third handout from class
HW2. Section 2.13 #2, #5, #24(a), (b), (c)
HW3. Section 18.12, #1, #2, #3 Bonus: #4
HW4: 1. Explain how a computer program designed to break a simple 
encryption scheme (e.g. shift cipher) might actually know when it has 
broken the code (with no human assistance).
2. Consider the following encryption scheme. Let P be the plaintext and 
let P[i] be the ith character of P. The ith character in the ciphertext, 
C[i], is found by taking the ith character from Shakespeare's "Hamlet" and 
adding P[i] (modulo the appropriate integer). What terms have we discussed 
that apply to this scheme? It is secure?
HW5. Section 3.13 #1, 5, 14(a), 17(a) Bonus: 10, 11
HW5.1 Section 6.8 #1, #2(a), #3, Bonus: #7, 16
HW6. Section 2.13 #6, Section 3.13: #7, 14(a)
HW7. Section 8.8. #1
HW8. Section 9.6 #3, 2a (bonus)