Factoring a binary polynomial of degree over one million

DOI10.1145/504331.504333zbMath1054.65047OpenAlexW2140863472MaRDI QIDQ4810180

Olaf Mueller, Joachim von zur Gathen, Michael Nöcker, Jürgen Gerhard, Olaf Bonorden

Publication date: 1 September 2004

Published in: ACM SIGSAM Bulletin (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/504331.504333

zbMATH Keywords

polynomial factorizationcomputer algebraparallel communicationCantor's multiplication algorithmpseudorandom polynomial

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05) Real polynomials: location of zeros (26C10)

Related Items

Computing special powers in finite fields, Interval partitions and polynomial factorization, A new sparse Gaussian elimination algorithm and the Niederreiter linear system for trinomials over \(\mathbb F_2\), Polynomial factorization over ${\mathbb F}_2$