+1 The default factor command in sage is rather slow.
On Feb 19, 9:48 am, jeffblakeslee <jeffb...@gmail.com> wrote: > Hello all, > > Please consider voting on the addition of msieve to sage. This > includes an interface file and an .spkg. Msieve, by Jason > Papadopoulos, should increase the integer factorization functionality > of Sage. I'll quote the words of Jason in the Readme file by way of > explanation: > > "There are plenty of algorithms for performing integer factorization. > The Msieve library implements most of them from scratch, and relies > on > optional external libraries for the rest of them. Trial division and > Pollard Rho is used on all inputs; if the result is less than 25 > digits > in size, tiny custom routines do the factoring. For larger numbers, > the > code > switches to the GMP-ECM library and runs the P-1, P+1 and ECM > algorithms, > expending a user-configurable amount of effort to do so. If these do > not > completely factor the input number, the library switches to the heavy > artillery. Unless told otherwise, Msieve runs the self-initializing > quadratic > sieve algorithm, and if this doesn't factor the input number then > you've > found a library problem. If you know what you're doing, Msieve also > contains > a complete implementation of the number field sieve, that has helped > complete > some of the largest public factorization efforts known." > > and > > "To be as fast as possible. I claim (without proof) that for > completely factoring general inputs between 40 and 100 digits in size, > Msieve is faster than any other code implementing any other algorithm." --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to sage-devel-unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
