ECS 2227 - Modern Cryptography - Fall 2003

ECS 227 - Modern Cryptography - Fall 2003 - Problem Sets

The problems are found in the class notes.

PS #1: Problems 1.1, 1.2, 1.6, a.7 Assigned Apr 4, Due Oct 13
PS #2: Problems 3.4, 3.11, 4.2, 4.4, 4.6. Assigned Apr 18, Due May 2
PS #3: Problems 5.7, 5.8, 5.9. Assigned May 2, Due May 11
PS #4: Problems 7.2 and Problem A: Prove a bound (the best you can) on Adv(A) = Pr[pi,pi' \getsr Perm(n): A^{\pi(.),\pi'(.)} -> 1] - Pr[pi\getsr Perm(n); K \getsr \{0,1\}^n: A^{\pi(.),\pi(. xor K)} -> 1] when A asks at most q queries. Your bound is a function of n and q. Assigned May 18, Due June 1