@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",
note = "Copyright: Copyright 2020 Elsevier B.V., All rights reserved.",
year = "1988",
doi = "10.1109/sfcs.1988.21944",
language = "English (US)",
isbn = "0818608773",
series = "Annual Symposium on Foundations of Computer Science (Proceedings)",
publisher = "Publ by IEEE",
pages = "283--290",
booktitle = "Annual Symposium on Foundations of Computer Science (Proceedings)",
}