Polynomial Factorization Over Finite Fields

Polynomial Factorization Over Finite Fields is the computational problem of decomposing a univariate polynomial with coefficients in a finite field into a product of irreducible polynomials over the same field, serving as a fundamental algorithmic task in computational number theory.

239

Publications

10.6K

Citations

317

Authors

182

Institutions

Publications per year

2017–2026

14

Authors

317

  1. EK
    Erich Kaltofen

    North Carolina State University, United States

    11 publications · 484 citations

    11

    h-index

  2. VS
    Victor Shoup

    IBM Research - Zurich, Switzerland

    10 publications · 648 citations

    10

    h-index

  3. JV
    Joachim von zur Gathen

    University of Toronto, Canada

    9 publications · 462 citations

    9

    h-index

  4. LR
    Lajos Rónyai

    Hungarian Academy of Sciences, Hungary

    7 publications · 141 citations

    7

    h-index

  5. LC
    L. Carlitz

    Duke University, United States

    6 publications · 128 citations

    6

    h-index

1–5 of 317

Venues

  1. Mathematics of Computation

    MCOM · 27 publications · 1.4K citations

    17

    h-index

  2. Finite Fields and Their Applications

    23 publications · 774 citations

    17

    h-index

  3. Journal of Symbolic Computation

    11 publications · 359 citations

    11

    h-index

  4. SIAM Journal on Computing

    8 publications · 690 citations

    8

    h-index

  5. Designs Codes and Cryptography

    8 publications · 225 citations

    8

    h-index

1–5