✦ LIBER ✦

Deterministic Analysis of Aleatoric Methods of Polynomial Factorization over Finite Fields

✍ Scribed by M. Rothstein; H. Zassenhaus

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 677 KB
Volume: 47
Category: Article
ISSN: 0022-314X
DOI: 10.1006/jnth.1994.1024

No coin nor oath required. For personal study only.

✦ Synopsis

We analyze the problem of finding the roots of an arbitrary polynomial over a finite field (equivalent to factoring an arbitrary polynomial over the field) and propose a deterministic approach which leads to a combinatorial problem whose satisfactory solution would yield a factoring method which is polynomial in the logarithm of the size of the field and the degree of the input polynomial. 1994 Academic Press, Inc.

📜 SIMILAR VOLUMES

On the deterministic complexity of facto

On the deterministic complexity of factoring polynomials over finite fields

✍ Victor Shoup 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 792 KB

The Complete Analysis of a Polynomial Fa

The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields

✍ P. Flajolet; X. Gourdon; D. Panario 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 315 KB

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

Counting irreducible factors of polynomi

Counting irreducible factors of polynomials over a finite field

✍ Arnold Knopfmacher; John Knopfmacher 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 728 KB

Counting irreducible factors of polynomials over a finite field, Discrete Mathematics, 112 (1993) 103-l 18. Let F,[X] denote a polynomial ring in an indeterminate X over a finite field IF,. Exact formulae are derived for (i) the number of polynomials of degree n in F,[X] with a specified number of i

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).