So today was about the uses of signatures and hash funtions, and was fairly similar to the lecture on Friday. The first section was on how to use RSA as a way of signing electronic contracts, the next on ElGamal's version of that, the third was on hash functions and how they make signatures shorter and easier to compute and the last section was on the birthday attack on hash functions. I thought it was clever how Alice foiled the birthday attack by changing a comma.
The ElGamal algorithm seemed less intuitive than the RSA version, but this may be because RSA is somthing I had heard about before taking this class and ElGamal is not. I plan on looking over ElGamal more thouroughly before the next test. It is not as straightforward as RSA. Which is more common to use? Do they have different strengths and weaknesses? It seems that there are mor attacks on RSA, because we have spent a lot of time on RSA attacks.
No comments:
Post a Comment