Thursday, October 8, 2009

6.1 The RSA Algorithm

  • The hardest part of the reading was understanding how knowing n and phi of n gives us p and q (the prime factors of n).
  • The most interesting part of the reading was seeing how abstract algebra is used to send a pretty secure message. It's neat to see how prime numbers are so useful.

No comments:

Post a Comment