1. This was a very cool section and I really liked it a lot! Although I had to read it slowly to make sure that I was understanding it correctly and following along, and really pay attention to the examples and go over them until I understood them, I'm a tad confused on the second to last paragraph on p. 87 where it talks about gcd(a-b,n)=p. I guess I understand it, I just might need a couple more examples :)
2. This section was great! It was very interesting learning about Square roots mod n, and it's nice to have a quick way to factor n. I know that this will help in RSA when n is a very large number made up of two large primes, and so it's all very helpful!
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment