#417: Faster GF(p^n) arithmetic for p^n >= 2^16
--------------------------------+-------------------------------------------
Reporter: malb | Owner: somebody
Type: enhancement | Status: new
Priority: minor | Milestone: sage-4.7.2
Component: basic arithmetic | Keywords:
Work_issues: | Upstream: N/A
Reviewer: | Author:
Merged: | Dependencies:
--------------------------------+-------------------------------------------
Comment(by malb):
I don't think anybody worked on this much. GF(2^e^) was switched to NTL,
but nothing else happened.
However, the GF(2^e^) should be a reasonable starting point for doing
other fields (word-sized primes and general primes).
Also, we should eventually move sparse moduli interally but that's for
another project :)
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/417#comment:7>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
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-trac?hl=en.
