ECE 424 / CS 463 Computer Security
Fall 2007
Final Exam

Assigned 12/8, Due 12/15.
Turn in ONLY accepted by toner/ink/pencil-on-dead-tree delivery to 464 CSL
by 5pm Central Time on 12/15. Electrons delivered by email will be ignored; 
physical electron delivery is not recommended.

You MAY NOT collaborate with others on problem #1. You MAY collaborate with
anyone on the extra credit. 

1. Write between 50 words and one page (10pt, 2 column, reasonable margins),
relating your final project with one of the project presentations on 11/27
and 11/29.  You may not choose your own project presentation.

Extra Credit. Prove or disprove the existance of a probabilistic polynomial 
time algorithm that, given g^a mod p and g^b mod p, can compute g^{ab} mod p. 
Assume that p = 2q+1, where q is also prime, and g generates a subgroup of
order at least q. (That is, the set {g^i mod p} contains at least q elements).