7.1 and 7.2 due May 9th

What was difficult?

The difficult part (like usual) was keeping up with the math and notations. Following the Pohlig-Hellman Algorithm was hard and required several read throughs to follow. I also gave up on trying to understand the Baby Step, Giant Step section.

Reflections:

Like factoring, it amazes me that logarithms are hard to find in modular math. It just seems that if it is easy to do in regular math then it should be easy in modular math, however, this is not the case. It also seems interesting how just because the Pohlig-Hellman algorithm doesn't work for p=3(mod 4) it is hard (as far as we know) to calculate discrete logs.