The explicit construction of irreducible polynomials over finite fields
Designs, Codes and Cryptography
Elliptic curves in cryptography
Elliptic curves in cryptography
Very Fast Parallel Matrix and Polynomial Arithmetic
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
A knapsack-type public key cryptosystem based on arithmetic in finite fields
IEEE Transactions on Information Theory - Part 1
Recurrent Methods for Constructing Irreducible Polynomials over GF(2s)
Finite Fields and Their Applications
Irreducible compositions of polynomials over finite fields
Designs, Codes and Cryptography
A recurrent method for constructing irreducible polynomials over finite fields
CASC'11 Proceedings of the 13th international conference on Computer algebra in scientific computing
Recurrent methods for constructing irreducible polynomials over Fq of odd characteristics, II
Finite Fields and Their Applications
Explicit theorems on generator polynomials
Finite Fields and Their Applications
| Hi-index | 0.00 |
In this paper, the irreducibility of the composition of polynomials (dx^2+rx+h)^nP(ax^2+bx+cdx^2+rx+h) with n=1 being the degree of P(x)@?F"q[x] is considered. Furthermore, some recurrent methods for constructing families of monic irreducible (including self-reciprocal) polynomials of degree n2^k(k=1,2,3,...) over a finite field of odd characteristics is given.