7.3-7.5, due on November 1

1. (Difficult) I love the simplicity of these systems.  I'm sure they weren't obvious when they were thought of, but they are just so simple when they're explained.  The most difficult part was the arguments about equivalent problems with Diffie-Hellman and ElGamal.  I have confidence that the constructions are correct, but I just kind of scanned them and didn't try to follow them through.  Interesting result, though.
2. (Reflective) I find it interesting that these two subjects receive little attention compared to RSA, which had it's own chapter.  Perhaps this is the case because they share much of the same math to make them secure.  I also wonder if they are less-frequently used.  I believe a type of DH key exchange is possible with TLS, but I'm not sure of the applications of ElGamal.  I'd be interested to know if it is commonly used (I guess I could look it up :-) ).