Wednesday, September 11, 2013

2.9-2.11, due on Sept 20

Difficult:
     I would like a bit of clarification on pseudo-random number generators. Some of them seemed to make a lot sense while I wasn't really clear what the others did. I also got lost on the linear shift register sequences. I understand how it requires you to have less bits in advance I was unclear as to how the proofs that were in the book completely applied to the actual encryption of the data.

Reflective:
     I think it is interesting that we actually have a cipher that is unbreakable. The OneTimePad Cipher seems so simple it's a bit hard to see how it can be so good. It makes sense that we can't really use it in practice as much because of it requires that your key be as long your text which is reasonably unfeasible if you want to encrypt something very long.

No comments:

Post a Comment