Module finite 

Contains an implementation of factoring polynomials over finite fields.

Functions

fast_poly_eeaunstable-enable

Computes a Bezout identity for polynomials, using a fast divide-and-conquer polynomial gcd algorithm. Unless you are implementing crate::pid::PrincipalIdealRing for a custom type, you should use crate::pid::PrincipalIdealRing::extended_ideal_gen() to get a Bezout identity instead.

poly_gcd_finite_reducedunstable-enable

Computes the gcd of two polynomials over a finite and reduced ring.

poly_power_decomposition_finite_fieldunstable-enable

Returns a list of (fi, ki) such that the fi are monic, square-free and pairwise coprime, and f = a prod_i fi^ki for a unit a of the base field.

poly_squarefree_part_finite_fieldunstable-enable

Computes the square-free part of a polynomial f, i.e. the greatest (w.r.t. divisibility) polynomial g | f that is square-free.