#16354: Let Sage use Pari implementation of Allombert algorithm to compute
embeddings of finite fields
-------------------------------------+-------------------------------------
Reporter: jpflori | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-6.3
Component: finite rings | Resolution:
Keywords: | Merged in:
Authors: Jean-Pierre Flori | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/jpflori/ticket/16354 | 9169f8ed1da13c57244eb7c1aa94db4b40165d49
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Description changed by jpflori:
Old description:
> It's much faster theoretically and in practice than what we have
> (factorization of polynomials).
New description:
It's much faster theoretically and in practice than what we have
(factorization of polynomials).
{{{
sage: p = next_prime(2**5)
sage: n = next_prime(2**7)
sage: K.<a> = GF(p**n, modulus='random')
sage: L.<b> = GF(p**n, modulus='random')
sage: H = Hom(K, L)
sage: from sage.rings.finite_rings.hom_finite_field import
FiniteFieldHomomorphism_generic as FFH
sage: %timeit FFH(H)
1 loops, best of 3: 6.58 s per loop
sage: %timeit FFH(H, algorithm='allombert')
1 loops, best of 3: 2.3 s per loop
}}}
--
--
Ticket URL: <http://trac.sagemath.org/ticket/16354#comment:2>
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/d/optout.
