16.2, due on December 2

• The most difficult part of this reading for me was the plaintext section. I couldn't really follow how to encode plaintext and how to get it back. Hopefully this will be cleared up in lecture on Wednesday.
  
• The best part about this reading is that it brought back discrete logs. Not that I love them terribly, but they are doable. It didn't go too far into detail about it, but I can do discrete logs. And, a modified Pohlig-Helman algorithm wouldn't be too hard to work through. I also enjoyed the first part of the reading, where we learned about elliptic curves mod p. I've also got a feeling that we can use this method to help us factor n. Not that I want to, but I think it may lead to that.