(Interesting)
Modular Exponentiation seems like it would be amazingly useful in cryptography, especially given the restrictions of current technology. It is fascinating that a calculation could be performed in two different ways, one which could require a few hundred calculations, and the other could require more calculations than a modern computer could ever store, or even compute given years of computing time. I am curious to know how this method fits into cracking cryptosystems as well.
(Difficult)
Although I understood the proof regarding the unique solutions for the Chinese Remainder Theorem, I had a hard time following the explanation of how to find a solution. I was also unsure if we were trying to reduce a composite mod into its primes, or take two primes and find a number mod the multiple of the primes.
No comments:
Post a Comment