1. The section was pretty straight forward. It seemed to basically be giving a straight forward algorithm for finding roots given a specific modulus. The hard part came toward the very end when it started to tie everything back to cryptography and specifically large primes (n) used as the modulus and its factors. I guess I'm having trouble connecting all the pieces, especially just seeing the big picture of where each number is coming from.
2. With all the methods being introduced through the reading that make it easier to factor n and so forth, I must admit that I'm questioning the security of RSA. That is to say, I know full well that it IS VERY secure, but with all the ways that we are discussing as to how to crack RSA, I'm wondering what precautions are taken to ensure security. For instance, do the designers of the keys just ensure that the conditions necessary to find roots mod n are not met, therefore the attacker can't find a root and consequently can't factor n?
No comments:
Post a Comment