Sunday, November 3, 2013

sections 7.3-7.5

Difficult: I think the Diffie Hellman Key Exchange would to interesting and difficult to encrypt/decrypt by hand for sure, but I also think the Computational Diffie-Hellman Problem would be difficult to compute period. Could you show an example in class?

Interesting: The bit commitment section was really interesting. I had never really thought of it before, but it makes since in some situations that someone would make a bet/prediction or something like that and would not want the other person to know what they sent until a certain day/time. It's kind of like sending a gift before someone's birthday and not wanting them to open it until their birthday, even though it was sent early. I think it's a really cool way to accomplish this, because before, you just had an honor system so to speak, but this way, you can't change the bet/whatever, and Bob can't open it until you give him the 'key' so to speak.

No comments:

Post a Comment