Thursday, September 5, 2013

1.1-1.2 and 3.1, due on September 6

1.  I am learning the same thing about gcd's and Eucilds algorithm, so none of this is especially new. I think the only thing that looks little difficult is the Prime Number Theorem. I am just a little confused at how it works. It would be nice to have an example in class and seeing how it is important.
2.  So far, what I think is interesting is all the examples of cryptography from WWI and WWII. It's cool to see how compared to then, how complex it is to send a secret message. I especially liked the example of the Germans sending a message saying everything is normal, when it was actually encrypted with a new key each day.

No comments:

Post a Comment