✦ LIBER ✦

The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields

✍ Scribed by P. Flajolet; X. Gourdon; D. Panario

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 315 KB
Volume: 40
Category: Article
ISSN: 0196-6774
DOI: 10.1006/jagm.2001.1158

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Factoring Polynomials Over Finite Fields

Factoring Polynomials Over Finite Fields: A Survey

✍ Joachim von zur Gathen; Daniel Panario 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 452 KB

This survey reviews several algorithms for the factorization of univariate polynomials over finite fields. We emphasize the main ideas of the methods and provide an up-to-date bibliography of the problem.

The Factorization of Dickson Polynomials

The Factorization of Dickson Polynomials over Finite Fields

✍ Wun-Seng Chou 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 257 KB

Let T n (x, a) ʦ GF(q)[x] be a Dickson polynomial over the finite field GF(q) of either the first kind or the second kind of degree n in the indeterminate x and with parameter a. We give a complete description of the factorization of T n (x, a) over GF(q).

Factorization of Polynomials over Finite

Factorization of Polynomials over Finite Fields and Characteristic Sequences

✍ Harald Niederreiter; Rainer Göttfert 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 360 KB

A Class of Polynomials over Finite Field

A Class of Polynomials over Finite Fields

✍ Arnaldo Garcia; Henning Stichtenoth 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 129 KB

Generalizing the norm and trace mappings for % O P /% O , we introduce an interesting class of polynomials over "nite "elds and study their properties. These polynomials are then used to construct curves over "nite "elds with many rational points.

Factorization of the Cyclotomic Polynomi

Factorization of the Cyclotomic Polynomialx2n+ 1 over Finite Fields

✍ Helmut Meyn 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 152 KB

The aim of this note is to show that the (well-known) factorization of the 2 nϩ1 th cyclotomic polynomial x 2 n ϩ 1 over GF(q) with q ϵ 1 (mod 4) can be used to prove the (more complicated) factorization of this polynomial over GF(q) with q ϵ 3 (mod 4).

On Value Sets of Polynomials over a Fini

On Value Sets of Polynomials over a Finite Field

✍ Wayne Aitken 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 254 KB

We study value sets of polynomials over a finite field, and value sets associated to pairs of such polynomials. For example, we show that the value sets (counting multiplicities) of two polynomials of degree at most d are identical or have at most q!(q!1)/d values in common where q is the number of