### Abstract

We relate the arithmetic straight-line complexity over a field GF(p) (p is a prime) of the parity function l_{p} 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 l_{p} into a factoring algorithm. As a consequence, a short straight-line program for l_{p} would imply the existence of an efficient factoring method.

Original language | English |
---|---|

Pages (from-to) | 571-577 |

Number of pages | 7 |

Journal | Computers and Artificial Intelligence |

Volume | 15 |

Issue number | 6 |

Publication status | Published - Dec 1 1996 |

### Keywords

- 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

Rónyai, L., & Szántó, Á. (1996). Prime-field-complete functions and factoring polynomials over finite fields.

*Computers and Artificial Intelligence*,*15*(6), 571-577.