Thursday, October 7, 2010

6.1 due on October

1. I don't understand where the polynomial X^2-(n-phi(n)+1)X+n came from. It seems like a real useful polynomial for RSA.  The rest of the section was straight forward after the previous class lectures.
2. The RSA is neat in how simple the concepts are quite simple when compared to DES and AES. It seems like it would be easy to break all you have to do is factor a number, but it isn't the case. It is cool they use just a couple of math theorems for the method.

No comments:

Post a Comment