Difficult:
I don't know how the modular exponentiation method they explained works. It says that we square both sides which I understand but then it just adds some numbers together and multiplies others together. I do understand that a computer could obviously do this method much better because it would never need to take up a bunch of memory holding really big numbers.
Reflective:
I was wondering what the Chinese remainder theorem is used for. It doesn't really give any examples in the book and it seems more strictly math than have a cryptography use. I may have just missed that but I didn't see where the Chinese remainder theorem was used elsewhere in the reading.
No comments:
Post a Comment