Some Remarks on Testing Irreducibility of Polynomials and Normality of Bases in Finite Fields
Sergej B. Gashkov, Гашков Игорь Борисович · Fundamenta Informaticae · 2010
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.