On Tue, 05 Dec 2006 01:02:53 -0800, David Harvey <[EMAIL PROTECTED]> wrote: > Hi Nick, > > If you're interested in point-counting algorithms, something that > really needs work in SAGE is the code that counts points on elliptic > curves over non-prime finite fields. I improved it from the > hopelessly naive O(q^3) to the moderately naive O(q) recently, but of > course you know that's still entirely ridiculous. The situation is as > it is simply from lack of developer time. The relevant code is in > > /sage/schemes/elliptic_curves/ell_finite_field.py > > I believe people have written the libraries for this already, > probably in PARI and other places too, it would just be a matter of > wrapping them. > > No pressure --- just a suggestion if you're looking for something to do.
For the record, I'm not aware of any code in any component of SAGE that does fast point counting or point enumeration on curves over GF(p^n) for n > 1. I'd loved to be proved wrong. This is a major gap in SAGE's functionality. William --~--~---------~--~----~------------~-------~--~----~ 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/ -~----------~----~----~----~------~----~------~--~---
