Computer Science 4730 Homework
Homework 1 (due
8/27/09)
be relevant to data security on a network.
Homework 2 (due
9/3/09)
Chapter 2: 2.9, 2.15.
Homework 3 (due
9/10/09)
Chapter 3: 3.2, 3.6, 3.8, 3.9.
Homework 4 (due
9/17/09)
Chapter 4: 4.3, 4.6, 4.10,
4.19.
Homework 5 (due
9/24/09)
Chapter 5: 5.3, 5.6;
Chapter 6: 6.6, 6.8.
Homework 6 (due
10/1/09)
Chapter 7: 7.3, 7.5,
7.6, 7.12.
Homework 7 (due
10/8/09)
Chapter 8: 8.4, 8.10, 8.11,
8.16.
Homework 8 (due
10/15/09)
Chapter 9: 9.2, 9.7, 9.13,
9.17.
Homework 9 (due
10/22/09)
Chapter 10: 10.1, 10.7, 10.11.
Homework 10 (due
10/29/09)
Chapter 11: 11.2, 11.4, 11.6.
Chapter 12: 12.1, 12.2, 12.7.
Chapter 13: 13.1, 13.5, 13.7,
13.9.
Chapter 14: 14.1, 14.3,
14.4.
Chapter 15: 15.1, 15.3, 15.7;
Chapter 16: 16.3, 16.4.
Homework 15 (due
12/3/09)
Chapter 17: 17.2.
Instructions
concerning the programs:
Program 1 (due
9/17/09)
http://homepage.smc.edu/morgan_david/vpn/des.htm
-or- the Simplified AES algorithm from Appendix 5b, page 165.
Show
the results of each step of encryption and decryption of the same sentence
using each of 3 different keys.
Program 2 (due
10/8/09)
Write a program to generate pseudo-random
numbers using the linear congruential method
described on page 221-223 of the
book; allow each of the parameters to be entered.
Using a small "m" value, generate
and print the succession of values until it
begins to repeat.
Program 3 (due
10/29/09)
6 properties discussed on page 335. The
first three properties should be easy
to verify. Try some brute-force
methods to test the last three properties
within time limits.
Program 4 (due
11/19/09)
using different symmetric keys for
each of the two parties and a hash
function that they both share.