1.1-1.2 and 3.1, due on September 2

• The part of the material that was most difficult for me was understanding all of the language in section 1.2 about Cryptographic Applications. It was hard for me to keep everything straight. There were a few of the applications that were similar to each other. Namely: authentication and non-repudiation were extremely similar. I guess beside those two, the hard part is going to be remembering all of the different applications.
• I was very impressed when I read through section 3.1. I actually remembered learning this material in an early math theory class. I had Stephen Humphries for a professor and learned all about the Euclidean Algorithm and the Prime Number Theorem as well as aspects and properties of divisibility. That was one of my favorite classes. So, this material actually directly connects to material I've learned before, and it was a great refresher.