I've posted a release candidate for sage-2.4 here:
http://sage.math.washington.edu/home/was/tmp/rc/
It would be helpful if a few people would build this and, if that works,
do a "make test", and let me know what happens. I will make an
official release sometime on Sunday.
Here's what's includ
(Partial) factorization (by trial division) of p-1 is in other to make
use
of CRT of discrete logarithms mod m where m | p-1.
The index calculus algorithm requires a relations collection phase,
and
a linear algebra phase. The linear algebra phase just requires
sparse
linear algebra over F_2 to d
On 3/24/07, Michel <[EMAIL PROTECTED]> wrote:
>
> I tested the plain version. It computed the log of
>
> y=74854337848345720324273746248836352273
>
> modulo
>
> p=241336555202451377063690009552755901639
> (128bit)
> with base
> g=132937783468242454805077125996488454291
>
> in 15704.5 (setup time)
On 3/23/07, William Stein <[EMAIL PROTECTED]> wrote:
> On 3/23/07, Timothy Clemans <[EMAIL PROTECTED]> wrote:
> > Any idea when the notebooks will be back up and when you will release 2.4?
>
> The notebooks are now up. Unfortunately, exactly the configuration
> I used to make http://www.sagenb.or
Special thanks to David Harvey for instigating.
On Mar 23, 10:19 pm, "William Stein" <[EMAIL PROTECTED]> wrote:
> On 3/23/07, David Joyner <[EMAIL PROTECTED]> wrote:
>
>
>
> > Let me be the first on this list to congratulate you! IMHO, this is a
> > big contribution..
>
> > I'm not sure how to br
Sorry factoring p-1 for an 128 bit number p is of course
not an issue. I was confuse.
Michel
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, v
I tested the plain version. It computed the log of
y=74854337848345720324273746248836352273
modulo
p=241336555202451377063690009552755901639
(128bit)
with base
g=132937783468242454805077125996488454291
in 15704.5 (setup time) + 18681.4 seconds on a 1.6GHz
laptop with 1Gb.
(the answer is 4711
