I agree about not rewriting for the sake of it -- but this was on the to-do list for SD5, wasn't it? Perhaps the to-do is to implement over GF(q) what we already have over GF(p).
John (forwarding to sage-devel a thread that started amongst SD6 planners) ---------- Forwarded message ---------- From: Martin Albrecht <[EMAIL PROTECTED]> Date: 30 Oct 2007 22:21 Subject: Re: Sage Days 6 To: John Cremona <[EMAIL PROTECTED]> > You were down to implement baby step giant step to compute E(F_q). I > did that quite recently for mwrank so you might find the C++ code > there helpful. Actually I did that because while LiDIA had it > already, I wanted mwrank to work fully under NTL, so I started by > "converting" the LiDIA code into NTL, but ended up reworking > everything (so the result is a lot more efficient than LiDIA's). Note > that here we are only talking about E(F_q) where q is prime (which is > *only* because I did not have access to other finite fields in NTL, > the algorithm worls for general q) and also such that numbers of size > q can be factored easily. One needs much more sophisticated > algorithms for larger primes (as I believe already exist in SAGE). On > the plus side (1) I give generators for E(F_q), not just the order, > and (2) since I use the Weil pairing, I implemented that too. > All of this is in principal available from the mwrank package, but I > guess th idea is to rewrite it in SAGE. I am speaking quite generally here, but why is the idea to rewrite? Generally the idea of Sage is not to rewrite. Martin PS: This should be on [sage-devel]. -- name: Martin Albrecht _pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99 _www: http://www.informatik.uni-bremen.de/~malb _jab: [EMAIL PROTECTED] -- John Cremona --~--~---------~--~----~------------~-------~--~----~ 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/ -~----------~----~----~----~------~----~------~--~---
