### Abstract

An algorithm is presented for finding an irreducible polynomial of specified degree over a finite field. It is deterministic and runs in polynomial time for fields of small characteristics. A proof is given of the stronger result, that the problem of finding irreducible polynomials of specified degree over a finite field K is deterministic-polynomial-time reducible to the problem of factoring polynomials over the prime field of K.

Original language | English (US) |
---|---|

Title of host publication | Annual Symposium on Foundations of Computer Science (Proceedings) |

Publisher | Publ by IEEE |

Pages | 283-290 |

Number of pages | 8 |

ISBN (Print) | 0818608773 |

State | Published - 1988 |

### Fingerprint

### ASJC Scopus subject areas

- Hardware and Architecture

### Cite this

*Annual Symposium on Foundations of Computer Science (Proceedings)*(pp. 283-290). Publ by IEEE.

**New algorithms for finding irreducible polynomials over finite fields.** / Shoup, Victor.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Annual Symposium on Foundations of Computer Science (Proceedings).*Publ by IEEE, pp. 283-290.

}

TY - GEN

T1 - New algorithms for finding irreducible polynomials over finite fields

AU - Shoup, Victor

PY - 1988

Y1 - 1988

N2 - An algorithm is presented for finding an irreducible polynomial of specified degree over a finite field. It is deterministic and runs in polynomial time for fields of small characteristics. A proof is given of the stronger result, that the problem of finding irreducible polynomials of specified degree over a finite field K is deterministic-polynomial-time reducible to the problem of factoring polynomials over the prime field of K.

AB - An algorithm is presented for finding an irreducible polynomial of specified degree over a finite field. It is deterministic and runs in polynomial time for fields of small characteristics. A proof is given of the stronger result, that the problem of finding irreducible polynomials of specified degree over a finite field K is deterministic-polynomial-time reducible to the problem of factoring polynomials over the prime field of K.

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

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

M3 - Conference contribution

AN - SCOPUS:0024135389

SN - 0818608773

SP - 283

EP - 290

BT - Annual Symposium on Foundations of Computer Science (Proceedings)

PB - Publ by IEEE

ER -