A new polynomial factorization algorithm and its implementation
From MaRDI portal
Cited in
(45)- Fast arithmetic for triangular sets: from theory to practice
- Univariate polynomial factorization over finite fields
- Algorithms for adaptive factorization of polynomials
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
- \(\operatorname {SL}(2,11)\) is \({\mathbb Q}\)-admissible
- A verified implementation of the Berlekamp-Zassenhaus factorization algorithm
- Subquadratic-time algorithms for normal bases
- Random self-reducibility of ideal-SVP via Arakelov random walks
- A new approach for finding low-weight polynomial multiples
- A new efficient factorization algorithm for polynomials over small finite fields
- Interval partitions and polynomial factorization
- Fast computation of special resultants
- Improving the algorithms of Berlekamp and Niederreiter for factoring polynomials over finite fields
- Deterministic encoding into twisted Edwards curves
- Polynomial factorization over ${\mathbb F}_2$
- scientific article; zbMATH DE number 3880116 (Why is no real title available?)
- Factorisation sur $\mathbb {Z}[X]$ des polynômes de degré élevé à l’aide d’un monomorphisme
- A Hybrid Approach for Normal Factorization of Polynomials
- Calculating the set of orders of elements in the finite linear groups
- Fast algorithms for computing isogenies between elliptic curves
- Code Generation for Polynomial Multiplication
- scientific article; zbMATH DE number 4006369 (Why is no real title available?)
- scientific article; zbMATH DE number 4069025 (Why is no real title available?)
- A New Algorithm for Factoring Polynomials Over Finite Fields
- Genus 2 point counting over prime fields
- scientific article; zbMATH DE number 1263216 (Why is no real title available?)
- Factoring high-degree polynomials over $\mathbf F_2$ with Niederreiter's algorithm on the IBM SP2
- On a New Factorization Algorithm for Polynomials Over Finite Fields
- Subquadratic-time factoring of polynomials over finite fields
- Remarks on the Schoof-Elkies-Atkin algorithm
- A solution to certain polynomial equations with applications to nonlinear fitting
- scientific article; zbMATH DE number 800174 (Why is no real title available?)
- scientific article; zbMATH DE number 922258 (Why is no real title available?)
- Implementing the tangent Graeffe root finding method
- Fast convolutions meet Montgomery
- Factoring polynomials over finite fields: A survey
- A New Black Box Factorization Algorithm - the Non-monic Case
- Elimination ideal and bivariate resultant over finite 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
- Bivariate polynomial reduction and elimination ideal over finite fields
- Threshold Niederreiter: chosen-ciphertext security and improved distributed decoding
- Faster modular composition
- Structured ramp secret sharing schemata over rings of real polynomials
This page was built for publication: A new polynomial factorization algorithm and its implementation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1914167)
