1. (Difficult) Is the p-1 factoring algorithm called that because at the end of the algorithm we look at the gcd(b-1,n)=d? Can you explain why you if you use the method at the top of pg. 183 to ensure that p-1 has at least one larger prime factor, that will make it hard to factor n=pq using the p-1 method?
2. (Reflective) This section seemed pretty straight-forward. I had never heard of this algorithm, but it is an interesting way to factor n. I am excited to learn about elliptical curve factorization because I have heard of elliptical curves before from "The Proof," the movie about Andrew Wiles proofing Fermat's Little Theorem. Obviously, the elliptical curves that he was using are much more complicated that we will be dealing with, but I think it will be fun to learn about.
No comments:
Post a Comment