1. These sections actually aren't terribly difficult, as I've taken Math 371 (Abstract Algebra). Now that I've said that, let me clarify by saying that it will be good to review some of this stuff. The most difficult part will be dealing with large numbers. However, the Euclidean Algorithm and other similar tools will make that process easier. There is one part that stood out to me in difficulty: "Multiplication by i gives k=(a-b)i (mod n). Substituting back into x=(b+nk), then reducing mod mn, gives the answer." I would like to see more about that last step, the substituting back in part.
2. Upon further reflection, I see more and more why computers work in binary. The modular exponentiation works really fast by simply using powers of 2. Although, it is pretty funny to read where it says that they never had to work with a number larger than 788^2. This is true, but they say it as if 788^2 isn't a big number. In anyone's book, I think it's big. But I understand the context, meaning that it isn't as big as some of the numbers they would be working with had they not taken this detour through binary.
No comments:
Post a Comment