A Deterministic Algorithm for Factorizing Polynomials over Extensions GF(pm) of GF(p), p a Small Prime

DOI10.1080/02522667.1989.10698971zbMath0688.12007OpenAlexW1994854637MaRDI QIDQ4206831

J. A. Thiong-Ly

Publication date: 1989

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1989.10698971

zbMATH Keywords

deterministic algorithmtrace functionsfactorizing polynomials

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Polynomials over finite fields (11T06)

Related Items

Computing Frobenius maps and factoring polynomials ⋮ Factoring of \(x^ n -1\) and orthogonalization over finite fields of characteristic 2 ⋮ Univariate polynomial factorization over finite fields ⋮ Factoring polynomials over finite fields: A survey

Cites Work

• Unnamed Item
• On Character Sums and Primitive Roots^†
• Improving an algorithm for factoring polynomials over a finite field and constructing large irreducible polynomials