#12142: Speed up Pari finite field operations
------------------------------------+---------------------------------------
Reporter: johanbosman | Owner: AlexGhitza
Type: enhancement | Status: new
Priority: major | Milestone: sage-5.11
Component: basic arithmetic | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: Peter Bruin | Merged in:
Dependencies: | Stopgaps:
------------------------------------+---------------------------------------
Changes (by {'newvalue': u'Peter Bruin', 'oldvalue': ''}):
* cc: pbruin (removed)
* author: => Peter Bruin
Comment:
I have been working on an interface to PARI's implementation of finite
fields (`t_FFELT`). Like for the other interfaces (except the existing
PARI polmod implementation), the field class is written in Python and the
element class in Cython. I hope to upload a patch soon after cleaning up
the documentation and fixing a minor problem.
The speed improvement for addition and multiplication relative to the
current implementation appears to vary roughly from a factor 3 to a factor
12, depending on the size of the field.
For small fields, this PARI interface is (of course) much slower than
Givaro (a factor 4-6 for '''F'''_{3^10^}). For fields of characteristic
2, it is slower than NTL+gf2x, but the difference is not that dramatic.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/12142#comment:4>
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 unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/groups/opt_out.
