1. These sections were pretty straightforward, but I feel like I might not understand quite fully what is happening. They mention in the introduction of chapter 9 that we are not trying to encrypt m at all, but in 9.1, Alice's signature is m^dA. Isn't this encrypting m then? I think there is something I am not quite getting.
2. I was very interested in the birthday attack. It seems interesting to me to try and create two separate documents, and change them just slightly to try and make it so both have the same hash, then use their signature against them. At the end, they mention to do something small, like remove a comma, or any slight alteration to foil this method. I wonder how this would actually work in some cases. But I also am intrigued by the idea, especially after our last homework where we basically made two hashes similar in this way.
No comments:
Post a Comment