8.1-8.2, due on November 3

1. (Difficult) The most difficult part of this section was following the discrete log hash function.  Understanding how to use it probably wouldn't be too hard if asked to do so, but the demonstration that finding knowing m != m' but h(m) = h(m') allows you to know the solve a discrete log problem was hard to follow.  It is also hard to remember the different security properties, but they are similar to what I've seen before, and with some practice could probably do so.
2. (Reflective) If I recall, there's currently a contest to determine the next government-recommended hash algorithm, kind of like there was for AES.  I'd be curious to know the status of the competition, and to learn of any new ideas that are being tried.