A new polynomial factorization algorithm and its implementation
From MaRDI portal
Publication:1914167
DOI10.1006/jsco.1995.1055zbMath0854.11074OpenAlexW2073842331MaRDI QIDQ1914167
Publication date: 13 August 1996
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/bfbd4439a1a1cef691de91b5e3ad45165899da02
finite fieldimplementationunivariate polynomialsbaby step/giant step factoring methodpolynomial factorization algorithm
Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Parallel algorithms in computer science (68W10) Polynomials over finite fields (11T06)
Related Items
Implementing the Tangent Graeffe Root Finding Method ⋮ A solution to certain polynomial equations with applications to nonlinear fitting ⋮ Univariate polynomial factorization over finite fields ⋮ Elimination ideal and bivariate resultant over finite fields ⋮ Genus 2 point counting over prime fields ⋮ Univariate polynomial factorization over finite fields with large extension degree ⋮ \textsc{Rings}: an efficient Java/Scala library for polynomial rings ⋮ Zero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomials ⋮ Interval partitions and polynomial factorization ⋮ Calculating the set of orders of elements in the finite linear groups ⋮ Fast computation of special resultants ⋮ Improving the algorithms of Berlekamp and Niederreiter for factoring polynomials over finite fields ⋮ Factoring polynomials over finite fields: A survey ⋮ Fast algorithms for computing isogenies between elliptic curves ⋮ Subquadratic-time factoring of polynomials over finite fields ⋮ Remarks on the Schoof-Elkies-Atkin algorithm ⋮ Fast convolutions meet Montgomery ⋮ Subquadratic-time algorithms for normal bases ⋮ Deterministic Encoding into Twisted Edwards Curves ⋮ Fast arithmetic for triangular sets: from theory to practice ⋮ Code Generation for Polynomial Multiplication ⋮ Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey ⋮ Random self-reducibility of ideal-SVP via Arakelov random walks ⋮ \(\operatorname {SL}(2,11)\) is \({\mathbb Q}\)-admissible ⋮ Factoring high-degree polynomials over $\mathbf F_2$ with Niederreiter's algorithm on the IBM SP2 ⋮ Polynomial factorization over ${\mathbb F}_2$
