1. I wasn't too confused with this section because I already went over this in number theory. But, I was wondering why we had to use p = 3(mod 4) for our prime in the proposition. Is it because of something specific? I've seen it a couple times, but I don't know why it works.
2. It's interesting to see after going back and forth from chapter 3 to chapter 6 how they are building us up for RSA. They mention in this section about how we choose n=pq, and I think about how we are using that already! I think this means stuff is going to get a little harder in RSA!
No comments:
Post a Comment