论文信息 - Some Remarks on Testing Irreducibility of Polynomials and Normality of Bases in Finite Fields

Some Remarks on Testing Irreducibility of Polynomials and Normality of Bases in Finite Fields

We prove some improvements for well-known upper bound of complexity of testing irreducibility of polynomials over finite fields. Also the fast modification of well-known probabilistic algorithm finding a normal bases in special finite fields is presented.

Sergej B. Gashkov | Igor Gashkov | S. B. Gashkov | I. Gashkov

[1] Joachim von zur Gathen,et al. Modern Computer Algebra , 1998 .

[2] Erich Kaltofen,et al. On fast multiplication of polynomials over arbitrary algebras , 1991, Acta Informatica.

[3] Victor Y. Pan,et al. Fast Rectangular Matrix Multiplication and Applications , 1998, J. Complex..

[4] Victor Shoup,et al. Fast construction of irreducible polynomials over finite fields , 1994, SODA '93.

[5] S. B. Gashkov. On fast multiplication of polynomials, the Fourier and Hartley transforms , 2000 .

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

[7] Richard E. Blahut,et al. Fast Algorithms for Digital Signal Processing , 1985 .

[8] Joachim von zur Gathen,et al. Polynomial factorization over F2 , 2002, Math. Comput..

[9] Joachim von zur Gathen,et al. Constructing Normal Bases in Finite Fields , 1990, J. Symb. Comput..

[10] Donald E. Knuth,et al. The Art of Programming , 2011 .

[11] H. T. Kung,et al. Fast Algorithms for Manipulating Formal Power Series , 1978, JACM.

[12] Arnold Schönhage,et al. Schnelle Berechnung von Kettenbruchentwicklungen , 1971, Acta Informatica.

[13] Joachim von zur Gathen,et al. Computing Frobenius maps and factoring polynomials , 2005, computational complexity.

[14] Arnold Schönhage,et al. Schnelle Multiplikation von Polynomen über Körpern der Charakteristik 2 , 1977, Acta Informatica.