Dienst writes (in response to Ernst Mayer)
If one instead does a fast polynomial-evaluation stage 2, even one
with modest circular convolution length (to keep memory requirements
reasonable), the stage 2 depth for a given amount of work should rise
dramatically, perhaps 2-3 orders of
George Woltman wrote:
I wrote a program to analyze P-1 factoring success rate.
Yes, that's what I hoped to see. And your stage 2 work estimates
are in fact much too pessimistic - more on this shortly.
I assumed that GCDs are free (they certainly aren't)
Even if an individual GCD costs much
If one instead does a fast polynomial-evaluation stage 2, even one
with modest circular convolution length (to keep memory requirements
reasonable), the stage 2 depth for a given amount of work should rise
dramatically, perhaps 2-3 orders of magnitude. One needs to do an
extended GCD at the
Hi,
First off, thanks to all that have submitted ideas to my
factoring challenge. A few have even started to write the assembly code.
I hope to incorporate these ideas and code sometime next year.
Secondly, I must apologize for not reviewing and commenting on the
suggestions.
