New algorithms for finding irreducible polynomials over finite fields

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish (US)
Title of host publicationAnnual Symposium on Foundations of Computer Science (Proceedings)
PublisherPubl by IEEE
Pages283-290
Number of pages8
ISBN (Print)0818608773
StatePublished - 1988

Fingerprint

Polynomials

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

Shoup, V. (1988). New algorithms for finding irreducible polynomials over finite fields. In 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.

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Shoup, V 1988, New algorithms for finding irreducible polynomials over finite fields. in Annual Symposium on Foundations of Computer Science (Proceedings). Publ by IEEE, pp. 283-290.
Shoup V. New algorithms for finding irreducible polynomials over finite fields. In Annual Symposium on Foundations of Computer Science (Proceedings). Publ by IEEE. 1988. p. 283-290
Shoup, Victor. / New algorithms for finding irreducible polynomials over finite fields. Annual Symposium on Foundations of Computer Science (Proceedings). Publ by IEEE, 1988. pp. 283-290
@inproceedings{8b6a02ed8803459281170eed99cda509,
title = "New algorithms for finding irreducible polynomials over finite fields",
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.",
author = "Victor Shoup",
year = "1988",
language = "English (US)",
isbn = "0818608773",
pages = "283--290",
booktitle = "Annual Symposium on Foundations of Computer Science (Proceedings)",
publisher = "Publ by IEEE",

}

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 -