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 4711999358070443542788028291655182016) I don't know how competitive this is (what does Magma do?). The program only works for primes of the form p=rq+1 with q prime and r small. This is because one needs to do linear algebra modulo p-1 and for this one needs to know the factorization of p-1. (In the accompagnying paper the author states however that one can pretend (p-1)/2 to be prime. Either the linear algebra works, or it doesn't. In the latter case one discovers a factor of p-1. This idea does not seem to be implemented however). There is a also a version which uses the NFS but the author seems to imply it is less stable. Michel On Mar 24, 12:00 am, "Justin C. Walker" <[EMAIL PROTECTED]> wrote: > On Mar 23, 2007, at 10:16 , Michel wrote: > > > > > That looks like a good link. I just read through the article there and > > the author > > really seems to know his stuff. > > > There is GPL'ed code for the index calculus method over GF(p) > > as well as some other things. I didn't managed to compile it (yet?) > > as I don't have NTL installed outside sage. > > I think you should be able to do this by changing NTLPREFIX in the > Makefile to point to the library and headers in SAGE_ROOT. > > Justin > > -- > Justin C. Walker, Curmudgeon at Large > Director > Institute for the Enhancement of the Director's Income > ----------- > Nobody knows the trouble I've been > ----------- --~--~---------~--~----~------------~-------~--~----~ 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, visit this group at http://groups.google.com/group/sage-devel URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~----------~----~----~----~------~----~------~--~---
