1. The only thing real difficult about this sections was seeing the arithmetic done so quickly with such big numbers. I think if I were to see someone do it in person it might make a little more sense. Also the explanation about why m=c^d (mod n) wasn't too bad, but it was still a little hard to understand.
2. The other thing I thought about a lot was how this stuff can still work even when we are working modulo n. My initial instinct says that this fact would open up the possibilities for what values variables like c and d can hold. It seems like there could be a few ways that the encryption could come back to haunt you for some reason because of working modulo n. Also, the text states (but leaves it as an exercise) that even if gcd(m,n) does not equal 1 Bob can still recover the message. How does that work?
No comments:
Post a Comment