Affiliations: Department of Mechanics and Mathematics, Moscow State University, Vorobiovy Gory, Moscow, Russia. [email protected] | Faculty of Technology and Science, Department of Mathematics, Karlstads Universitet, Karlstad, Sweden. [email protected]
Note: [] The work was supported by grants RFFI 05–01–00994, Sci. Sch—5400.2006.1 Address for correspondence: Department of Mechanics and Mathematics, Moscow State University, Vorobiovy Gory, Moscow, Russia
Note: [] The work was supported by grant of the Royal Sweden Academy of Sciences
Abstract: 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.
Keywords: Finite fields, irreducible polynomials, normal bases, addition chains
