Title :
New algorithms for finding irreducible polynomials over finite fields
Author_Institution :
Dept. of Comput. Sci., Wisconsin Univ., Madison, WI, USA
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
Keywords :
polynomials; deterministic; finite fields; irreducible polynomials; polynomial time; specified degree; Arithmetic; Codes; Cryptography; Encoding; Galois fields; Polynomials; Radio access networks; Terminology;
Conference_Titel :
Foundations of Computer Science, 1988., 29th Annual Symposium on
Conference_Location :
White Plains, NY
Print_ISBN :
0-8186-0877-3
DOI :
10.1109/SFCS.1988.21944
