✦ LIBER ✦

On the deterministic complexity of factoring polynomials over finite fields

✍ Scribed by Victor Shoup

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 792 KB
Volume: 33
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(90)90195-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Deterministic Complexity of Facto

On the Deterministic Complexity of Factoring Polynomials

✍ Shuhong Gao 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 345 KB

The paper focuses on the deterministic complexity of factoring polynomials over finite fields assuming the extended Riemann hypothesis (ERH). By the works of and , the general problem reduces deterministically in polynomial time to finding a proper factor of any squarefree and completely splitting

Deterministic Analysis of Aleatoric Meth

Deterministic Analysis of Aleatoric Methods of Polynomial Factorization over Finite Fields

✍ M. Rothstein; H. Zassenhaus 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 677 KB

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

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

On power sums of polynomials over finite

On power sums of polynomials over finite fields

✍ Ernst-Ulrich Gekeler 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 584 KB

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