Thursday, October 29, 2015

7.2, due on October 30

1. I don't understand the part in the Pohlig-Hellman Algorithm where you break x into x0 + x1q1 . . . and why it works. I also didn't really understand the Computing Discrete Logs Mod 4.

2. I had the thought as I was reading that cryptography is just a lot of number theory. I also had the thought, "this is much funner than just plain number theory." It's because this points to something and has cool applications. It's not just proofs! :)

No comments:

Post a Comment