1.This section was very long and had a ton of information in it. The thing that I thought was a little confusing was the Pohlig-Hellman Algorithm. There were just a lot of steps to follow and I might have gotten a little lost. I'm very upset that I'm missing class tomorrow, because I really need to learn about these things. Beth/Braden better take dang good notes! Call them out if they're not, or if they talking or doing anything but paying attention and taking notes :)
2. I really liked this section a lot. I think it's cool how we can compute discrete logs, and the different methods we have to do so. On page 207 at the very top, it talks about how the baby step, giant step process works for primes up to 10^20, or slightly larger, and then it says that it's impractical for very large p, and when I read that I was thinking, "seriously? I thought that primes up to 10^20 was huge... but I guess not." So that was kinda funny :) Well, I'm sorry I'm missing class, some family matters came up that I have to attend to. I hope that your baby boy is doing well and your wife. I'm so happy for you! Have you guys come up with a name yet?? Well, I'll see you on Mon! Have a great weekend, and make sure to let your kids get lots of candy on Halloween! :)
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment