(Difficult) In section 7.5, I had a hard time understanding the proof concerning the machine that could solve Decision Diffie-Hellman problems and decide the validity of mod p ElGamal ciphertexts. The main point I didn't understand was why the ElGamal machine only outputs "yes" when m = 1 is the same as ca^(-xy).
(Reflective) When reading about bit commitment and the key exchange, I was thinking about how much more versatile public key encryption was compared to private key encryption. I know we discussed this at the beginning of the class, but it is nice to see all the examples of how public key systems can be used. When we had talked about using RSA to transfer a DES key I wasn't completely sure how this would work, but the Diffie-Hellman Key Exchange is an ingenious approach to using discrete logarithms to construct a key between two people.
No comments:
Post a Comment