Fermat's Factorization was the most interesting portion of this quick section. It is so simple but very powerful for small numbers and it still took a genius to come up with it. I like it because I can understand it and it uses the idea of working backwards to factor (relatively) large numbers.
The p-1 Factoring Algorithm was the only other topic discussed, and it wasn't crystal clear to me. One question I have is how B is chosen. It's only description is that it is a bound but I'm not sure what it is bounding. This method looks a lot like the Miller-Rabin Primality Test except it actually gives us factors instead of just determining if a number is prime or composite.
No comments:
Post a Comment