Changes between Initial Version and Version 1 of Ticket #14832


Ignore:
Timestamp:
Jun 27, 2013, 7:42:07 AM (10 years ago)
Author:
pbruin
Comment:

Legend:

Unmodified
Added
Removed
Modified
  • Ticket #14832

    • Property Status changed from new to needs_review
  • Ticket #14832 – Description

    initial v1  
    1 Currently, every finite field implementation (integers mod ''p'', Givaro, NTL, PARI) has its own code for constructing an irreducible polynomial when given a string as the `modulus` keyword.  Here is a patch that creates methods `PolynomialRing_dense_{finite_field,mod_p}.irreducible_element(n, algorithm=None)`.  In a separate ticket, the `FiniteField` constructor will be adapted to call this function.
     1Currently, every finite field implementation (integers mod ''p'', Givaro, NTL, PARI) has its own code for constructing an irreducible polynomial when given a string as the `modulus` keyword.  Here is a patch that creates methods `PolynomialRing_dense_{finite_field,mod_p}.irreducible_element(n, algorithm=None)`.  In a separate ticket (#14833), the `FiniteField` constructor is adapted to call this function.
     2
     3The default choice is now deterministic: Conway polynomials if available, otherwise lexicographically first (via NTL/GF2E) in characteristic 2, Adleman-Lenstra (via PARI) in characteristic > 2.
    24
    35Since it uses PARI's `ffinit`, this depends on #14817.