1. I do not understand how the two claims given at the end of the section fit together. I understand them individually, and that their purpose is to show that finding the decryption exponent d is essentially as hard as factoring n. Are they supposed to work together or build on each other? Or are they just two separate claims that when put together prove a point?
2. I really think the idea and use of a present key cryptosystem is interesting. I can definitely see its merits in that you don't have to send a key to the other person, and it's not incredibly difficult to use. I am enjoying learning about the algorithms that go along with the cryptosystems I've only previously heard about from a technology standpoint.
No comments:
Post a Comment