27 search results - page 1 / 6 » Fast Construction of Irreducible Polynomials over Finite Fie... |
SODA
1993
ACM
13 years 8 months ago
1993
ACM
FFA
2010
13 years 6 months ago
2010
We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact for...
MOC
1998
13 years 7 months ago
1998
D. Wan very recently proved an asymptotic version of a conjecture of Hansen and Mullen concerning the distribution of irreducible polynomials over finite fields. In this note we ...
FFA
2010
13 years 4 months ago
2010
Various results on parity of the number of irreducible factors of given polynomials over finite fields have been obtained in the recent literature. Those are mainly based on Swan&...
WAIFI
2010
Springer
14 years 15 days ago
2010
Springer
A cryptographic pairing evaluates as an element of a finite extension field, and the evaluation itself involves a considerable amount of extension field arithmetic. It is recogn...