1. (Difficult) When would be a situation when Claim 2 happened? When would you know both e and d? From the example, it seems like you would either only know n and e if you were the public, or you would know p, q, d already and thus would have no need to factor n because you already have the factors. Could you talk about the Pretty Good Privacy. I was confused by that paragraph.
2. (Reflective) RSA seems like a pretty secure way to encrypt a message, but I wonder how anyone thought of this method. I learned about it briefly in Math 190, but it makes more sense to me now. I remember doing simple examples, but for very small primes. It makes sense that the prime numbers have to be so large, or else n, could be factored easily using a computer.
No comments:
Post a Comment