Sections 3.6-3.7, Due October 6

Difficult: The argument for Euler's lemma seems a bit sketchy. Just reference the last theorem? I do see how it reduces to Fermat's Little Theorem when n is a prime though. Also, I do not see how a meet in the middle attack could be easily performed on the three pass protocol. It seems like, should you choose a large enough prime, then there would be too many possibly numbers with gcd(a,p-1)=1 to make the attack particularly fesable.

Reflective: I think the Three-pass protocol is an interesting method to pass encryption keys, and I think that the example of the locked box helps to remeber the method quite nicely. Also, I've never really gotten the idea of primitive roots until this section (3.7) though now I am not exactly sure what my hangup was. They seem clear enough now!