On Fri, 01 Dec 2006 20:45:06 -0800, David Joyner <[EMAIL PROTECTED]>
wrote:
>
> Bill:
> Someone asked me about the msieve program by
> Jason Papadopoulos. Does qsieve include msieve?
> Is msieve in SAGE?
Hi.
(1) qsieve is completely independent from msieve right now.
(2) mseive is not in SAGE; it is free/open source, but it has
no license.
(3) Here's what Bill Hart says:
"------- Forwarded message -------
From: "William Hart" <[EMAIL PROTECTED]>
To: [EMAIL PROTECTED]
Cc:
Subject: Quadratic Sieve and SAGE
Date: Fri, 29 Sep 2006 07:01:31 -0700
[...]
I haven't seen any other truly portable
implementations that are faster than mine, though I
don't discount the possibility of their existence.
Jason P's msieve certainly is faster (between 1.8 and
3 times faster depending on the size of the number
being factored), but it uses quite a bit of X86
assembly code and is not truly portable at this point
AFAIK. Eventually I may be able to close the gap
significantly on msieve anyhow, speedwise.
I still haven't implemented the large prime variation,
which should add about 30-40% to the speed, or more,
but it is quite a bit of coding, and simply isn't
necessary at this point.
[...]
Best Regards,
Bill Hart."
--~--~---------~--~----~------------~-------~--~----~
To post to this group, send email to [email protected]
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~----------~----~----~----~------~----~------~--~---
