1. I really enjoyed reading about these sections! As I was reading, I go through and put little question marks next to the things that I don't understand as I'm reading. The first thing that I didn't understand was on page 231, when they said that "the probability of exactly i matches is approximately λ^ie^-λ/i!. I just don't understand where they got this equation from. The next part that was a little confusing for me to understand was section 8.5 about the multicollisions. I was wondering if there is any certain size block that we know to split the message M into? Then the big paragraph on the bottom of p 234 became a little confusing. Oh and then my last question is for the last section. I was wondering, what if Bob and Alice can't get together to agree on a shared secret key KAB? Will it just not work? Ok, I think that was about it! I really liked these sections!
2. Yea!!!! The time has finally come to learn about Birthday attacks!! And I think that it was worth the wait! I really enjoyed reading about them, and learning all the cool stuff that it does! It's like I want to go find the probability of a ton of stuff now and then test it, like they said to in traffic. Or I want to ask all the people in my class what their birthdays are and see if there is a match, it's so fun! I also liked how we can use birthday attacks to solve discrete logs! Now we have a few methods to solving those. Multicollisions were fun to read about, but got a little confusing for me about half way through. And then learning about using the hash functions to encrypt was pretty sweet I thought! It's just so fun and cool to learn about what people can come up with when it comes to encrypting messages and stuff! I love it!
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment