Computational problems in the theory of finite fields

DOI10.1007/BF01810569zbMath0745.11056MaRDI QIDQ1180998

Rudolf Lidl

Publication date: 27 June 1992

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

zbMATH Keywords

survey; algorithms; computational complexity; finite fields; factoring polynomials; irreducible polynomials; discrete logarithm; available computer algebra software systems; special purpose software

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68W30: Symbolic computation and algebraic computation

11Y16: Number-theoretic algorithms; complexity

11T06: Polynomials over finite fields

Related Items

Primitive Normal Polynomials Over Finite Fields, Univariate polynomial factorization over finite fields

Uses Software

• GALOIS
• IBM Scratchpad

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Functional decomposition of polynomials: the tame case
• Functional decomposition of polynomials: the wild case
• Selfdual normal bases on \(\mathrm{GF}(q)\)
• On arithmetical algorithms over finite fields
• On the deterministic complexity of factoring polynomials over finite fields
• The distribution of values of polynomials over a finite field
• Low complexity normal bases
• Algebraic algorithms in GF(q)
• Discrete logarithms in \(\mathrm{GF}(p)\)
• Factoring polynomials and primitive elements for special primes
• Design of an experiment for the determination of an unknown coefficient in a nonlinear conduction-diffusion equation
• Optimal normal bases in \(GF(p^ n)\)
• A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
• Deterministic irreducibility testing of polynomials over large finite fields
• On the number of values taken by a polynomial over a finite field
• A new algorithm for multiplication in finite fields
• Fast evaluation of logarithms in fields of characteristic two
• Computing Logarithms in Finite Fields of Characteristic Two
• Finite field manipulations in Macsyma
• Factoring Multivariate Polynomials over Large Finite Fields
• Generalizations of the Normal Basis Theorem of Finite Fields
• Finding Isomorphisms Between Finite Fields
• New Algorithms for Finding Irreducible Polynomials Over Finite Fields
• О построении нормального базиса конечного поля
• Self-Complementary Normal Bases in Finite Fields
• When Does a Polynomial Over a Finite Field Permute the Elements of the Field?
• Factorization of Symmetric Matrices and Trace-Orthogonal Bases in Finite Fields
• Computational Complexity of Fourier Transforms Over Finite Fields
• Primitive Normal Bases for Finite Fields
• Polynomial decomposition algorithms
• Polynomial decomposition algorithms