Tuesday, September 14, 2010

Section 3.8, 2.5-2.8 due 15 Sept 2010

1. Again the most difficult part of today's reading was following the mathematical steps specifically those involving matrices and vector multiplication. I know I know this stuff, it just takes a little longer to process than it used to. The part that really gets me is when it says things like "try various values [of n] until we find the right one." The problem I have is that this would be an efficient use of code-cracking time. At first thought, it seems like there are an awful lot of integers that could be tried until we "find the right one." What I'd like to know is how exactly and efficiently does one try new values of n until the right one is found.
2. I'm starting to worry about some of the future codes that we will have to break using some of these methods. As mentioned above, it seems as if the only methods we'll have is to essentially shoot in the dark until we find solution.

No comments:

Post a Comment