Computer Science 4730 Homework
Homework 1 (due
1/12/06)
be relevant to data security on a network.
Homework 2 (due
1/19/06)
Chapter 2: 2.6, 2.8.
Homework 3 (due
1/26/06)
Chapter 3: 3.3, 3.7, 3.8.
Homework 4 (due
2/2/06)
Chapter 4: 4.3, 4.6, 4.10,
4.13.
Homework 5 (due
2/9/06)
Chapter 5: 5.3, 5.6;
Chapter 6: 6.4, 6.8.
Homework 6 (due
2/16/06)
Chapter 7: 7.3, 7.5, 7.7,
7.10.
Homework 7 (due
2/23/06)
Chapter 8: 8.3, 8.5, 8.6, 8.9.
Homework 8 (due
3/2/06)
Chapter 9: 9.2, 9.7, 9.10, 9.13.
Homework 9 (due
3/9/06)
Chapter 10: 10.1, 10.5, 10.8.
Homework 10 (due
3/23/06)
Chapter 11: 11.2, 11.4, 11.5.
Chapter 12: 12.1, 12.2, 12.3.
Chapter 13: 13.2, 13.3, 13.7,
13.11.
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
4/27/06)
Chapter 17: 17.1, 17.2.
Instructions
concerning the programs:
Program 1 (due
2/1/06)
the steps of encryption and decryption of a given sentence
for 3 different keys.
Program 2 (due
2/22/06)
Write a program to generate pseudo-random
numbers using the linear congruential method
described on page 222 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
3/22/06)
for the 6
properties discussed on page 329. The first three should be easy
to verify. Try some brute-force
methods to test the last three properties
within time limits.
Program 4 (due
4/12/06)
using different symmetric keys for
each of the two parties and a hash
function that they both share.