Factoring polynomials over finite fields

Research output: Contribution to journalArticle

17 Citations (Scopus)


We propose a new deterministic method of factoring polynomials over finite fields. Assuming the generalized Riemann hypothesis (GRH), we obtain, in polynomial time, the factorization of any polynomial with a bounded number of irreducible factors. Other consequences include a polynomial time algorithm to find a nontrivial factor of any completely splitting even-degree polynomial when a quadratic nonresidue in the field is given.

Original languageEnglish
Pages (from-to)391-400
Number of pages10
JournalJournal of Algorithms
Issue number3
Publication statusPublished - Sep 1988

ASJC Scopus subject areas

  • Control and Optimization
  • Computational Mathematics
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Factoring polynomials over finite fields'. Together they form a unique fingerprint.

  • Cite this