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

Authors:
Sergej B. Gashkov;Igor B. Gashkov
Affiliations:
(Correspd. The work was supported by grants RFFI 05–01–00994, Sci. Sch—5400.2006.1) Department of Mechanics and Mathematics, Moscow State University, Vorobiovy Gory, Moscow, Russ ...;(Correspd. The work was supported by grant of the Royal Sweden Academy of Sciences) Faculty of Technology and Science, Department of Mathematics, Karlstads Universitet, Karlstad, Sweden. Igor.Gach ...
Venue:
Fundamenta Informaticae - Hardest Boolean Functions and O.B. Lupanov
Year:
2010

Citing 9
Cited 0

On arithmetical algorithms over finite fields

Journal of Combinatorial Theory Series A
Constructing normal bases in finite fields

Journal of Symbolic Computation
On fast multiplication of polynomials over arbitrary algebras

Acta Informatica
Fast construction of irreducible polynomials over finite fields

Journal of Symbolic Computation
Fast rectangular matrix multiplication and applications

Journal of Complexity
Fast Algorithms for Manipulating Formal Power Series

Journal of the ACM (JACM)
Fast Algorithms for Digital Signal Processing

Fast Algorithms for Digital Signal Processing
Polynomial factorization over F2

Mathematics of Computation
Modern Computer Algebra

Modern Computer Algebra

Quantified Score

Hi-index	0.00

Visualization

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.