1. What didn't I understand? The question is what did I understand. I guess I'm still just unsure about hash functions. Also, why would we use the Birthday Attack if baby step giant step is "superior," as the book says? When it's talking about multicollisions, how do we know that we can find the two blocks m_0 and m'_0 in 2^(n/2) steps?
2. I think the birthday paradox is fascinating. It really doesn't make sense intuitively, but I liked the way they explained it as not looking for a match with "your" birthday necessarily, but a match between any two students. I kind of understood the birthday attack on discrete logarithms, and I'm excited to learn more about that in class.
No comments:
Post a Comment