1. The most difficult part was making sure that I understood the application of the theorem in the example, but it eventually made sense.
2. I thought it was interesting to use the proposition in the chapter to find a square root mod p, and then use the Chinese Remainder Theorem to find a square root mod a composite number. The application to RSA seems like it will be rather straightforward.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment