#8373: Construct finite fields with primitive defining polynomial
----------------------------------+------------------------
Reporter: rkirov | Owner: cpernet
Type: enhancement | Status: new
Priority: minor | Milestone: sage-6.4
Component: finite rings | Resolution:
Keywords: | Merged in:
Authors: Jeroen Demeyer | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: #16927 | Stopgaps:
----------------------------------+------------------------
Comment (by pbruin):
Replying to [ticket:8373 rkirov]:
> Also add an argument `modulus="pari"` (and make it the default) to use
PARI's `ffinit()`.
This already exists in `PolynomialRing_dense_mod_p.irreducible_element()`
under the name `modulus="adleman-lenstra"`. It is the default if no
Conway polynomial is known and the characteristic is odd.
Some finite field implementations accept a string `modulus`, but this
should be obsolete; `FiniteFieldFactory.create_key_and_extra_args()` uses
the above method to convert a string `modulus` into an actual polynomial.
--
Ticket URL: <http://trac.sagemath.org/ticket/8373#comment:11>
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.
