Construction of Irreducible Polynomials

[1]  Shuhong Gao.  Normal Bases over Finite Fields , 1993 .

[2]  Stephen D. Cohen.  The explicit construction of irreducible polynomials over finite fields , 1992, Des. Codes Cryptogr..

[3]  Victor Shoup,et al.  Searching for primitive roots in finite fields , 1990, STOC '90.

[4]  Victor Shoup.  On the Deterministic Complexity of Factoring Polynomials over Finite Fields , 1990, Inf. Process. Lett..

[5]  Stephen D. Cohen.  The reducibility theorem for linearised polynomials over finite fields , 1989, Bulletin of the Australian Mathematical Society.

[6]  David G. Gantor.  On arithmetical algorithms over finite fields , 1989 .

[7]  Joel V. Brawley,et al.  Infinite algebraic extensions of finite fields , 1989 .

[8]  Victor Shoup,et al.  New algorithms for finding irreducible polynomials over finite fields , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[9]  Ronald L. Rivest,et al.  A knapsack-type public key cryptosystem based on arithmetic in finite fields , 1988, IEEE Trans. Inf. Theory.

[10]  Erich Kaltofen,et al.  Deterministic Irreducibility Testing of Polynomials over Large Finite Fields , 1987, J. Symb. Comput..

[11]  L. Carlitz,et al.  Irreducibles and the composed product for polynomials over a finite field , 1987, Discret. Math..

[12]  Leonard M. Adleman,et al.  Finding irreducible polynomials over finite fields , 1986, STOC '86.

[13]  Harald Niederreiter,et al.  Introduction to finite fields and their applications: List of Symbols , 1986 .

[14]  Jacques Calmet.  Algebraic algorithms in GF(q) , 1985, Discret. Math..

[15]  J. Gathen,et al.  Factorization of multivariate polynomials over finite fields , 1985 .

[16]  Wayne Eberly,et al.  Very Fast Parallel Matrix and Polynomial Arithmetic , 1984, FOCS.

[17]  Rudolf Lide,et al.  Finite fields , 1983 .

[18]  S. Agou.  Irréductibilité des polynômes $f(sum sp{m}sb{i=0}asb{i}Xsp{psp{ri}})$ sur un corps fini ${f F}sb{psp{s}}$ , 1980 .

[19]  Michael O. Rabin,et al.  Probabilistic Algorithms in Finite Fields , 1980, SIAM J. Comput..

[20]  S. Agou.  Irréductibilité des polynômes f(Xp2r − aXpr − bX) sur un corps fini Fps , 1978 .

[21]  S. Agou.  Irréductibilité des polynomes f (Xpr - aX) sur un corps fini Fps. , 1977 .

[22]  Stephen D. Cohen.  On irreducible polynomials of certain types in finite fields , 1969 .

[23]  Elwyn R. Berlekamp,et al.  Algebraic coding theory , 1984, McGraw-Hill series in systems science.

[24]  M. C. R. Butler.  The Irreducible Factors of f(xm) over a Finite Field , 1955 .

[25]  J. Serret.  Cours d'Algebre superieure , 1885 .