1. I didn't understand the p-1 factoring algorithm hardly at all. Conceptually or in practice. I also don't remember if for the Fermat factorization if we have discovered how to know what integers squared are mod p. Like for the example, how did we know 295927 + 3^2 = 544^2 mod 295927 (without simply squaring 544 of course)?
2. I really like the Fermat method of factorization. Once we compute n + 1, n + 4, n + 9, etc. and find which is congruent to a square mod n, the process is very very simple :)
No comments:
Post a Comment