(Interesting) Fermat's Factorization method is a rather clever method of factoring. It appears to be similar to the continued fraction attack, since they both involve squares. The nice thing about Fermat's method is the simplicity of it. It really only involves squaring numbers and finding square roots, everything else is addition and subtraction.
(Difficult) The p-1 factoring algorithm was difficult to follow. It appeared more like an RSA attack than a factoring method, since factorization is not guaranteed by this method. I would really appreciate an example of this algorithm in class.
No comments:
Post a Comment