Prime-field-complete functions and factoring polynomials over finite fields

Lajos Rónyai, Ágnes Szántó

Research output: Contribution to journalArticle

2 Citations (Scopus)


We relate the arithmetic straight-line complexity over a field GF(p) (p is a prime) of the parity function lp to the Boolean complexity of the problem of factoring polynomials over finite fields of characteristic p. A procedure is described which converts an arithmetic straight-line program for lp into a factoring algorithm. As a consequence, a short straight-line program for lp would imply the existence of an efficient factoring method.

Original languageEnglish
Pages (from-to)571-577
Number of pages7
JournalComputers and Artificial Intelligence
Issue number6
Publication statusPublished - Dec 1 1996


  • Arithmetic complexity
  • Boolean complexity
  • Factoring polynomials over finite fields
  • Straight-line program

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint Dive into the research topics of 'Prime-field-complete functions and factoring polynomials over finite fields'. Together they form a unique fingerprint.

  • Cite this