Difficult:
I think I understand the basic idea behind factoring with elliptic curves. Essentially the two primes p and q that compose n behave differently and thus we can find pa and q. I had a difficult time following the examples so I think an in class example would be very helpful.
Reflective:
I was wondering how the elliptic curve method of factoring compares with other methods of factoring. It seems like it can be much quicker in some cases. However, it also seems that as long as we choose good large primes we can still be fairly sure that n won't be factored. I was wondering how much better the method is and also if it is more versatile.
No comments:
Post a Comment