7.2, due on October 29

1. (Difficult) These techniques were rich in symbols.  I thought each of the techniques for calculating discrete logs were confusing, and didn't always understand the reasoning behind why they work.  I didn't always try to follow the math, but when I did I didn't always even follow the arithmetic.  I am comforted that there are examples, and hope I can use them if required for the homework.
2. (Reflective) I am trying to remember if we discussed discreet logs being a way to break RSA in CS 465.  It seems like solving m^d = c (mod n), for d would be similar to the discrete log problem.  Perhaps it is different because n is not prime?  I think our substitute professor was discussing discrete logs where n is not prime, but I'm not sure if we will look further into that.  I do wonder how, or if, they relate to RSA.