Friday, October 23, 2009

6.4 for lecture 23 October

1. The p-1 factoring algorithm was a little difficult, I am still not totally sure why it works, but I did find the idea very interesting.

2. I had thought of something like the Fermat factorization method over the summer, but realized as the book stated that the algorithm could take a long time if you pick your primes carefully.

No comments:

Post a Comment