It was interesting to read about the birthday attack idea from a cryptological standpoint. I have talked about it a lot in my actuarial classes and done problems with it before but this did a better job explaining the reasoning behind its paradoxical conclusions than I had heard before. Interesting to see how the idea relates to choosing keys or codes or even messages.
If the baby step giant step method is superior to the birthday method, is there any reason to ever use the birthday method in real life?
I see how the birthday attack idea relates to multicollisions but I am still shaky on how to find said collisions. Section 8.7 seems to be a lot of the material that we have read before and especially that we talked about in class on Wed, so i feel pretty comfortable with it.
No comments:
Post a Comment