Distinct Degree Factorisation
Separating irreducible factors by degree using GCDs against Frobenius powers, and the early-abort strategies that make it fast.
Every page in the KEVOS library tagged Finite Field. 8 pages.
Separating irreducible factors by degree using GCDs against Frobenius powers, and the early-abort strategies that make it fast.
Selecting representations and algorithms for real finite field workloads, with the operation mixes that arise in factoring, decomposition and point counting.
Representing elements of a finite field as polynomials modulo an irreducible, choosing the modulus, and the trade-offs against logarithmic and normal bases.
Elimination over a finite field, structured methods for very large sparse systems, and why the linear algebra stage limits sieving methods.
Finding roots of a polynomial in a finite field by GCD with the Frobenius polynomial followed by probabilistic splitting.
Decomposing a finite-dimensional commutative algebra over a finite field into its simple components, generalising polynomial factorisation.
Berlekamp's linear algebra approach to factoring over a finite field, the Berlekamp subalgebra, and when it outperforms the GCD pipeline.
Squarefree decomposition, distinct-degree factorisation by gcd with x^(q^d) − x, equal-degree splitting by Cantor-Zassenhaus, and Berlekamp's linear-algebra approach.