A New Algorithm for Factoring Polynomials Over Finite Fields
From MaRDI portal
Publication:3955477
Recommendations
- On a New Factorization Algorithm for Polynomials Over Finite Fields
- scientific article; zbMATH DE number 691482
- A new efficient factorization algorithm for polynomials over small finite fields
- scientific article; zbMATH DE number 1594303
- Polynomial factorization algorithms over number fields
- A new polynomial factorization algorithm and its implementation
- An efficient algorithm for factoring polynomials over algebraic extension field
- A new faster algorithm for factoring skew polynomials over finite fields
- New Algorithms for Finding Irreducible Polynomials Over Finite Fields
- Factoring polynomials over arbitrary finite fields
Cites work
- scientific article; zbMATH DE number 3557181 (Why is no real title available?)
- scientific article; zbMATH DE number 3341170 (Why is no real title available?)
- An improvement of Rabin's probabilistic algorithm for generating irreducible polynomials over GF(p)
- Factoring Polynomials Over Large Finite Fields
- On the Efficiency of Algorithms for Polynomial Factoring
- Probabilistic Algorithms in Finite Fields
Cited in
(97)- On arithmetical algorithms over finite fields
- Fast rectangular matrix multiplication and applications
- On the complementary factor in a new congruence algorithm
- On polynomial modular number systems over \(\mathbb{Z}/p\mathbb{Z}\)
- The black-box Niederreiter algorithm and its implementation over the binary field
- scientific article; zbMATH DE number 1303020 (Why is no real title available?)
- Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields
- Implementing the tangent Graeffe root finding method
- Factoring polynomials using fewer random bits
- Computing conjugating sets and automorphism groups of rational functions
- A Highly Scalable RFID Authentication Protocol
- A verified implementation of the Berlekamp-Zassenhaus factorization algorithm
- Factoring Multivariate Polynomials over Large Finite Fields
- Improving the algorithms of Berlekamp and Niederreiter for factoring polynomials over finite fields
- Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes
- On a family of preimage-resistant functions
- scientific article; zbMATH DE number 6500356 (Why is no real title available?)
- Computing primitive idempotents in finite commutative rings and applications
- scientific article; zbMATH DE number 7564415 (Why is no real title available?)
- Factoring polynomials over finite fields with Drinfeld modules
- Factoring polynomials over local fields.
- Optimal forgeries against polynomial-based MACs and GCM
- Computing isomorphisms and embeddings of finite fields
- Cryptographic applications of capacity theory: on the optimality of Coppersmith's method for univariate polynomials
- Deterministic root finding in finite fields
- Computing Frobenius maps and factoring polynomials
- Preimages of \(p\)-linearized polynomials over \(\mathbb{F}_p\)
- A new efficient factorization algorithm for polynomials over small finite fields
- The Rabin cryptosystem revisited
- Explicit equivalence of quadratic forms over \(\mathbb{F}_q(t)\)
- Succinct non-interactive arguments via linear interactive proofs
- On the deterministic complexity of factoring polynomials over finite fields
- Computing explicit isomorphisms with full matrix algebras over \(\mathbb {F}_q(x)\)
- Factoring multivariate polynomials via partial differential equations
- Is every matrix similar to a polynomial in a companion matrix?
- Deterministic root finding over finite fields using Graeffe transforms
- scientific article; zbMATH DE number 1273636 (Why is no real title available?)
- Connections between the algorithms of Berlekamp and Niederreiter for factoring polynomials over \(\mathbb{F}_ q\)
- On the computation of rational points of a hypersurface over a finite field
- Interval partitions and polynomial factorization
- Computer construction of split Cartan subalgebras
- Computing discrete logarithms in the Jacobian of high-genus hyperelliptic curves over even characteristic finite fields
- A public key cryptosystem based on Diophantine equations of degree increasing type
- An effective description of the roots of bivariates mod pk and the related Igusa’s local zeta function
- \textsc{Rings}: an efficient Java/Scala library for polynomial rings
- Generating Genus Two Hyperelliptic Curves over Large Characteristic Finite Fields
- On algorithms to find \(p\)-ordering
- Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring
- Using the theory of cyclotomy to factor cyclotomic polynomials over finite fields
- Are fifth-degree equations over \(GF(5^ m)\) solvable by radicals?
- Univariate polynomial factorization over finite fields
- Decomposition of algebras over finite fields and number fields
- Kronecker's and Newton's approaches to solving: a first comparison
- A note on Gröbner bases and Berlekamp's algorithm
- New Sparse Multivariate Polynomial Factorization Algorithms over Integers
- On splitting sets in block designs and finding roots of polynomials
- Towards a quantum-resistant weak verifiable delay function
- Towards a soluble quotient algorithm
- On a New Factorization Algorithm for Polynomials Over Finite Fields
- A new approach for finding low-weight polynomial multiples
- Factoring polynomials over finite fields: A survey
- Efficiently factoring polynomials modulo \(p^4\)
- Factoring polynomials and primitive elements for special primes
- A heuristic irreducibility test for univariate polynomials
- Analysis of Euclidean algorithms for polynomials over finite fields
- Polynomial factorization over finite fields by computing Euler-Poincaré characteristics of Drinfeld modules
- SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption
- One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model
- Average-case linear matrix factorization and reconstruction of low width algebraic branching programs
- Testing isomorphism of graded algebras
- Isogeny problems with level structure
- A generalisation of the Cantor-Zassenhaus algorithm
- A generalized successive resultants algorithm
- Using partial smoothness of \(p-1\) for factoring polynomials modulo \(p\)
- Trading GRH for algebra: algorithms for factoring polynomials and related structures
- Distinct Degree Factorizations for Polynomials over a Finite Field
- Subquadratic-time factoring of polynomials over finite fields
- Deterministic irreducibility testing of polynomials over large finite fields
- The complete analysis of a polynomial factorization algorithm over finite fields
- Limits on the power of prime-order groups: separating Q-type from static assumptions
- Polynomial factorization over ${\mathbb F}_2$
- Short presentations for finite groups
- Factoring polynomials over finite fields
- On the degrees of irreducible factors of polynomials over a finite field
- Algebraic algorithms in GF(q)
- On Bivariate Polynomial Factorization over Finite Fields
- Accelerating the Delfs-Galbraith algorithm with fast subfield root detection
- On the Complexity of the Montes Ideal Factorization Algorithm
- Computing a group action from the class field theory of imaginary hyperelliptic function fields
- Solving polynomial systems over non-fields and applications to modular polynomial factoring
- Computing the structure of finite algebras
- Polynomial factorization algorithms over number fields
- Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata over \(\mathbb{Z}_p\)
- Univariate polynomial factorization over finite fields with large extension degree
- Iterative root approximation in \(p\)-adic numerical analysis
- Sublinear root detection and new hardness results for sparse polynomials over finite fields
- Computing special powers in finite fields
This page was built for publication: A New Algorithm for Factoring Polynomials Over Finite Fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3955477)