Factorisation of Polynomials Modulo a Prime

Q: Why must squarefree decomposition come first?

Because distinct-degree factorisation returns the product of the distinct irreducible factors of each degree, with multiplicities lost. Running it on a non-squarefree input silently discards multiplicity information and the reconstructed factorisation will not multiply back to the input.

Q: How does this generalise to extension fields?

Directly: replace p by the field size q throughout. The only care needed is in the characteristic-2 case of equal-degree splitting, where the exponentiation must be replaced by the trace map because (q^d − 1)/2 is not an integer.

Q: Can the same pipeline factor over Z/nZ for composite n?

No. Without a field the quotient ring has zero divisors, GCDs need not exist, and the factorisation is not unique. An attempted GCD that fails does, however, reveal a factor of n.

Executive summary

Three phases, each solving a strictly easier problem than the last

Factoring over a finite field is completely solved in polynomial time, but not by a single algorithm. The standard pipeline first removes repeated factors, then groups the remaining irreducible factors by their degree, and only then separates factors of equal degree — the one phase that requires randomisation. Each phase reduces to GCD computations and modular exponentiation in the quotient ring.

Learning objectives

Perform squarefree decomposition, including the characteristic-p special case.
Separate factors by degree using gcd with x^{q^d} − x.
Apply equal-degree splitting and analyse its success probability.
Compare Berlekamp's method with the distinct-degree pipeline.
Choose an approach based on the field size.

Section 01Phase 1: squarefree decomposition

If f has a repeated factor, that factor divides gcd(f, f′). Peeling off repeated factors by successive GCDs gives the squarefree decomposition. In characteristic p there is a complication: if f′ is identically zero then f is a p-th power.

AlgorithmSquarefree decomposition in characteristic pin: f ∈ F_q[x] → out: squarefree factors with multiplicities

If f′ = 0, then f = g(x^p) for some g. Take p-th roots of the coefficients — the Frobenius is a bijection on F_p — and recurse on g.
Otherwise set c ← gcd(f, f′) and w ← f / c.
Repeatedly extract gcd(w, c), which isolates factors of successive multiplicities.
Output the list of (factor, multiplicity) pairs.

Do not import the characteristic-zero version

Over ℚ, f′ = 0 only for constants. Over F_p it happens for every p-th power, and code that omits this branch will divide by a zero polynomial or loop. This is one of the most frequently missed cases in finite-field code.

Section 02Phase 2: distinct-degree factorisation

The polynomial x^{q^d} − x is the product of all monic irreducibles whose degree divides d. Taking GCDs for d = 1, 2, 3, … therefore extracts the factors degree by degree.

AlgorithmDistinct-degree factorisationin: squarefree f → out: for each d, the product of the degree-d factors

Set g ← f (squarefree) and h ← x.
For d = 1, 2, 3, … while deg g ≥ 2d:
Set h ← h^q mod g. One Frobenius step; h now equals x^{q^d} mod g.
Set c ← gcd(g, h − x). If c ≠ 1, record c as the product of all irreducible factors of degree d, and set g ← g / c.
If g ≠ 1, it is irreducible of degree greater than the last d tested; record it.

Frobenius is the workhorse

Each iteration raises the current h to the q-th power modulo g. Precomputing the matrix of the Frobenius map on the quotient ring turns each step into a matrix–vector product, which is the standard optimisation for repeated factorisations over the same field.

Section 03Phase 3: equal-degree splitting

A product of r distinct irreducibles all of degree d corresponds by the Chinese remainder theorem to a product of r copies of the field of q^d elements. A random element raised to the power (q^d − 1)/2 lands on ±1 independently in each component, so a GCD with the result splits the factors apart with high probability.

AlgorithmCantor–Zassenhaus equal-degree splitting (odd q)in: f, a product of r irreducibles of equal degree d → out: the factors

If deg f = d, output f as irreducible and return.
Choose a random a ∈ F_q[x] with deg a < deg f.
Set b ← a^{(q^d−1)/2} mod f.
Set c ← gcd(f, b − 1). If c is trivial, return to step 2.
Recurse on c and on f / c.

Randomised in time, exact in output

Every factor is confirmed by an exact GCD before being returned, so the algorithm never emits an incorrect factorisation. Randomisation affects only how long it takes.

Section 04Berlekamp's algorithm and method selection

Berlekamp's approach is entirely different: it computes the kernel of the map v ↦ v^q − v on the quotient ring. The kernel dimension equals the number of irreducible factors, and each kernel element yields a splitting.

Choosing a factorisation method over F<sub>q</sub>
Situation	Method	Reason
q small (say under 100)	Berlekamp	Deterministic; the search over field elements is cheap
q large	Distinct-degree plus Cantor–Zassenhaus	Berlekamp's search space scales with q; the randomised split does not
Only the number of factors is needed	Berlekamp kernel dimension	One linear algebra computation, no splitting required
Only irreducibility is in question	Degree test via Frobenius	Far cheaper than a full factorisation
Only the roots are needed	gcd with x^q − x, then split	Avoids computing higher-degree factors entirely

Irreducibility is much cheaper than factorisation

To test irreducibility of degree n it suffices to check that x^qⁿ = x modulo f and that gcd(f, x^{q^n/ℓ} − x) = 1 for each prime ℓ dividing n. No factors are produced — and none are needed.

ReferenceFrequently asked questions

Why must squarefree decomposition come first?

Because distinct-degree factorisation returns the product of the distinct irreducible factors of each degree, with multiplicities lost. Running it on a non-squarefree input silently discards multiplicity information and the reconstructed factorisation will not multiply back to the input.

How does this generalise to extension fields?

Directly: replace p by the field size q throughout. The only care needed is in the characteristic-2 case of equal-degree splitting, where the exponentiation must be replaced by the trace map because (q^d − 1)/2 is not an integer.

Can the same pipeline factor over Z/nZ for composite n?

No. Without a field the quotient ring has zero divisors, GCDs need not exist, and the factorisation is not unique. An attempted GCD that fails does, however, reveal a factor of n.

NavigateContinue in this stream

Curated next steps from this page. The site also surfaces algorithmically related reading below.

ProvenanceSources and further reading

This page is an original KEVOS explanatory article. It presents the underlying mathematics — definitions, algorithms, complexity results and selection criteria — in KEVOS editorial voice. No text is reproduced from any copyrighted source. Where numerical tables are relevant, KEVOS links to live authoritative databases rather than republishing static values.

Handbook application: from concept to controlled practice

Purpose. This expanded section turns the original page into a practical handbook. It preserves the supplied material and adds a repeatable way to apply, check and review Factorisation of Polynomials Modulo a Prime. It does not replace a contract, legislation, a controlled standard, competent engineering judgement or specialist advice.

The operating aim is to turn a compact mathematical statement into a usable chain of definitions, claims, examples and checks. Read the original explanation first, then use the workflow and checks below to convert knowledge into evidence.

Treat Factorisation of Polynomials Modulo a Prime as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—factorisation, section, phase, squarefree, decomposition—should be made explicit before any proof or computation begins. Record the ambient set or structure, the permitted operations and the equality or equivalence relation in use. A compact theorem often changes meaning when the base field, finiteness condition, commutativity assumption or direction of an action changes.

For a proof, write the hypotheses as a checklist and mark the line at which each one is used. For a computation, state the representation of the input, the arithmetic model, the termination condition and the output invariant. For a classification problem, distinguish existence from uniqueness and distinguish an object from its representation. These separations prevent a correct local calculation from being mistaken for the general result.

A useful worked example should be small enough to inspect completely but rich enough to exercise the main mechanism. Compute the result in two ways where practical: symbolically and by substitution, structurally and numerically, or directly and through a normal form. Then include one near-miss example in which a hypothesis fails. The contrast explains why the theorem is shaped as it is and gives the reader a diagnostic pattern for later problems.

Verification is part of the mathematics. Check domains and codomains, substitute proposed solutions, test identity and zero cases, compare dimensions or cardinalities, and confirm that maps respect the required operations. In numerical work, report precision, conditioning and a residual rather than digits alone. In algorithmic work, separate mathematical correctness from implementation complexity and resource limits.

Step-by-step operating method

Fix the setting. State the objects, ambient structure, notation and assumptions before manipulating symbols.
Separate claims. Distinguish definitions, hypotheses, conclusions, equivalent conditions and consequences.
Choose a method. Select proof, construction, calculation or algorithm according to the question actually asked.
Work a small case. Use the smallest non-trivial example to expose the mechanism and test edge behaviour.
Verify independently. Substitute back, check invariants, test boundary cases or use an alternative derivation.

Worked-example protocol

Illustrative method—not a source theorem. Start with a small admissible input and list the definitions it must satisfy. Carry out each transformation on a separate line, citing the property that permits it. Preserve exact values until approximation is necessary. At the end, verify the output against the original definition and one invariant such as dimension, degree, determinant, order, norm or residual. Then alter one hypothesis and observe which step ceases to be valid. This protocol creates a reusable example without inventing a theorem-specific numerical answer.

Stage	Record	Quality check
Input	Objects, domain, notation, assumptions	Every symbol is defined
Method	Permitted operation or cited result at each step	All hypotheses hold
Output	Exact result and representation	Correct type, domain and form
Verification	Substitution, invariant or alternative derivation	Independent agreement
Boundary test	Zero, identity, degenerate or failed hypothesis	Scope is understood

Common failure modes and recovery actions

1. Watch for

Using a theorem without checking every hypothesis.

Recovery: Return to the governing definition or requirement and restate the decision in one sentence.

2. Watch for

Treating a suggestive example as a proof of the general case.

Recovery: Separate evidence from assumption, assign an owner and set a date for validation.

3. Watch for

Changing notation or conventions part-way through an argument.

Recovery: Run a small counterexample, boundary test, pilot or independent check before proceeding.

4. Watch for

Hiding a division-by-zero, convergence, finiteness or commutativity assumption.

Recovery: Record the consequence, decision and rationale, then update the controlled baseline.

5. Watch for

Reporting a computed result without a residual, substitution or structural check.

Recovery: Escalate when the issue affects safety, compliance, acceptance, material value or an agreed tolerance.

Review checklist

Can every symbol be traced to a definition or prior result?
Which hypothesis does each major step use?
Does the method cover zero, identity, degenerate and boundary cases?
Can the conclusion be checked by a second representation or calculation?
Are mandatory requirements distinguished from recommendations and illustrative values?
Are sources, assumptions, units, dates and versions recorded closely enough to reproduce the decision?
Have safety, legal, ethical, stakeholder and operational consequences been considered at the appropriate level?
Is there a named owner and a trigger for review, escalation, change or retirement?

Questions for deeper application

What is the most important distinction a practitioner must preserve when applying Factorisation of Polynomials Modulo a Prime?