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 (#14833), the `FiniteField` constructor is adapted to call this function. |
| 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. This ticket does the following: |
| 2 | |
| 3 | - implement a new class `PolynomialRing_dense_finite_field` |
| 4 | - create methods `PolynomialRing_dense_{finite_field,mod_p}.irreducible_element(n, algorithm=None)`. |
| 5 | |
| 6 | In a separate ticket (#14833), the `FiniteField` constructor is adapted to call the new function. |