Difficult: This was one of the more difficult sections we have done. Interesting how it followed one of the simpiler sections, and also used it! The confusion started in the first theorem, where it says that "trying the method in the theorem for various values of k<1000 will eventually lead to the factorization of n." The theorem doesn't seem to give a method, just state that the factorization is possible given the conditions. So, I suppose I do not see how they would accomplish the factoring. I also had trouble understanding the argument in the timing attack, maybe because it is based on some aspects of probability that I do not understand.
Reflective: Though I did not understand the timing attack, it seemed ingenious! Somehow it makes sense that a student would think of using how long it takes a computer to work on the problem. Probably he was doing an exercise and was late turning in his homework when he thought up the idea! I can see how it would be simple to thwart this type of attack, it was just interesting that the attack could be successful.
No comments:
Post a Comment