Factoring polynomials over finite fields

Research output: Article

17 Citations (Scopus)

Abstract

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
Volume9
Issue number3
DOIs
Publication statusPublished - 1988

Fingerprint

Factoring
Galois field
Polynomials
Polynomial
Riemann hypothesis
Polynomial-time Algorithm
Factorization
Polynomial time

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computational Mathematics

Cite this

Factoring polynomials over finite fields. / Rónyai, L.

In: Journal of Algorithms, Vol. 9, No. 3, 1988, p. 391-400.

Research output: Article

@article{97c4b01d0e144908b8056adbea11ad56,
title = "Factoring polynomials over finite fields",
abstract = "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.",
author = "L. R{\'o}nyai",
year = "1988",
doi = "10.1016/0196-6774(88)90029-6",
language = "English",
volume = "9",
pages = "391--400",
journal = "Journal of Algorithms",
issn = "0196-6774",
publisher = "Academic Press Inc.",
number = "3",

}

TY - JOUR

T1 - Factoring polynomials over finite fields

AU - Rónyai, L.

PY - 1988

Y1 - 1988

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0042199326&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0042199326&partnerID=8YFLogxK

U2 - 10.1016/0196-6774(88)90029-6

DO - 10.1016/0196-6774(88)90029-6

M3 - Article

AN - SCOPUS:0042199326

VL - 9

SP - 391

EP - 400

JO - Journal of Algorithms

JF - Journal of Algorithms

SN - 0196-6774

IS - 3

ER -