Wednesday, November 14, 2012

14.1 and 14.2, due Wednesday Nov 14th

1. I didn't understand the steps of 14.2 super well. Basically, how Victor's check allows him to accurately guess that Peggy knows, s sub i.

2. Fascinating! Zero knowledge proofs are cool! Victor will never know both square roots of x1 and x2 and so cannot deduce sqrt of y :)

Monday, November 12, 2012

12.1 and 12.2, due Monday Nov 12

1. The hardest part about today's reading was focusing on it instead of studying for the test.

2. I liked the concept of secret sharing and being able to share the secret and make it known with only a handful of people.(section 12.2)

Friday, November 9, 2012

Q & A, due Friday November 9

1. I think the most important topics on exam 2 will be RSA and different decrytping techniques, discrete log problem and other related things like El Gamal, how to use a hash function correctly, and possibly something about a signature. Probably some relatively simple proof from chapter 3.

2. I need to review all of it. The Project 12 and recent homework assignments, etc. I'm much more nervous for this test than I was for the first...

Wednesday, November 7, 2012

8.3 and 9.5, due Wednesday November 7

1. I thought it was difficult to understand section 9.5.

2. I liked the similarity of sha to des. A lot of the same operations are used

Sunday, November 4, 2012

9.1-9.4, due Monday November 5

1. Cryptography is a fascinating thing. I couldn't find anything difficult in this reading except for how all of this was discovered/thought of. :D

2. I liked the reading of birthday attacks on signatures and wonder how often we are being handed such electronic documents that have fraudlent equivalents(as far as their hashes go). I thought the RSA signature was very concise but I hypothesize that if you were to combine it with a hash function you would be unable to retrieve the message(i.e. message recovery scheme would fail to work) I like it better than El Gamal and don't remember in which situations El Gamal is advantageous over RSA.

Thursday, November 1, 2012

8.4-8.5 and 8.7, due Fri Nov 2

1. I didn't understand why concatenation of hash functions does not apparently strengthen its preimage resistance. Or how they derived running times to find collisions.

2. I loved reading about the birthday paradox. I told my wife and she was (and I think still is skeptical that the chances are that high haha). 8.4.1 reminded me of BSGS.

Wednesday, October 31, 2012

8.1 & 8.2, due Wednesday October 31

1. The tricky part about understanding the reading was 8.2

2. 8.1 was really interesting especially because of the three properties it explained in the section