On bivariate polynomial factorization over finite fields

Igor E. Shparlinski

doi:10.1090/S0025-5718-1993-1176716-3

On bivariate polynomial factorization over finite fields

Igor E. Shparlinski^*

^*Corresponding author for this work

School of Computing

Research output: Contribution to journal › Article › peer-review

3 Citations (Scopus)

Abstract

This paper shows that a recently proposed approach of D. Q. Wan to bivariate factorization over finite fields, the univariate factoring algorithm of V. Shoup, and the new bound of this paper for the average number of irreducible divisors of polynomials of a given degree over a finite field can be used to design a bivariate factoring algorithm that is polynomial for "almost all" bivariate polynomials.

Original language	English
Pages (from-to)	787-791
Number of pages	5
Journal	Mathematics of Computation
Volume	60
Issue number	202
DOIs	https://doi.org/10.1090/S0025-5718-1993-1176716-3
Publication status	Published - 1993

Access to Document

10.1090/S0025-5718-1993-1176716-3

Cite this

@article{dd366b52899a406684e63d2f664de328,

title = "On bivariate polynomial factorization over finite fields",

abstract = "This paper shows that a recently proposed approach of D. Q. Wan to bivariate factorization over finite fields, the univariate factoring algorithm of V. Shoup, and the new bound of this paper for the average number of irreducible divisors of polynomials of a given degree over a finite field can be used to design a bivariate factoring algorithm that is polynomial for {"}almost all{"} bivariate polynomials.",

author = "Shparlinski, \{Igor E.\}",

year = "1993",

doi = "10.1090/S0025-5718-1993-1176716-3",

language = "English",

volume = "60",

pages = "787--791",

journal = "Mathematics of Computation",

issn = "0025-5718",

publisher = "American Mathematical Society",

number = "202",

}

TY - JOUR

T1 - On bivariate polynomial factorization over finite fields

AU - Shparlinski, Igor E.

PY - 1993

Y1 - 1993

N2 - This paper shows that a recently proposed approach of D. Q. Wan to bivariate factorization over finite fields, the univariate factoring algorithm of V. Shoup, and the new bound of this paper for the average number of irreducible divisors of polynomials of a given degree over a finite field can be used to design a bivariate factoring algorithm that is polynomial for "almost all" bivariate polynomials.

AB - This paper shows that a recently proposed approach of D. Q. Wan to bivariate factorization over finite fields, the univariate factoring algorithm of V. Shoup, and the new bound of this paper for the average number of irreducible divisors of polynomials of a given degree over a finite field can be used to design a bivariate factoring algorithm that is polynomial for "almost all" bivariate polynomials.

UR - https://www.scopus.com/pages/publications/84968492801

U2 - 10.1090/S0025-5718-1993-1176716-3

DO - 10.1090/S0025-5718-1993-1176716-3

M3 - Article

AN - SCOPUS:84968492801

SN - 0025-5718

VL - 60

SP - 787

EP - 791

JO - Mathematics of Computation

JF - Mathematics of Computation

IS - 202

ER -

On bivariate polynomial factorization over finite fields

Abstract

Access to Document

Other files and links

Fingerprint

Cite this