A New Algorithm for Factoring Polynomials Over Finite Fields
From MaRDI portal
Publication:3955477
DOI10.2307/2007663zbMath0493.12024OpenAlexW4231623775MaRDI QIDQ3955477
David G. Cantor, Hans J. Zassenhaus
Publication date: 1981
Full work available at URL: https://doi.org/10.2307/2007663
Polynomials in general fields (irreducibility, etc.) (12E05) Polynomials over finite fields (11T06) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to field theory (12-04)
Related Items
On the computation of rational points of a hypersurface over a finite field, Using partial smoothness of đ-1 for factoring polynomials modulo đ, Implementing the Tangent Graeffe Root Finding Method, Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring, Computing Frobenius maps and factoring polynomials, Preimages of \(p\)-linearized polynomials over \(\mathbb{F}_p\), On algorithms to find \(p\)-ordering, Factoring multivariate polynomials via partial differential equations, Succinct non-interactive arguments via linear interactive proofs, Deterministic root finding over finite fields using Graeffe transforms, Explicit equivalence of quadratic forms over \(\mathbb{F}_q(t)\), Factoring polynomials and primitive elements for special primes, Towards a soluble quotient algorithm, Computing special powers in finite fields, Computing the structure of finite algebras, Optimal forgeries against polynomial-based MACs and GCM, Polynomial factorization algorithms over number fields, Short presentations for finite groups, Are fifth-degree equations over \(GF(5^ m)\) solvable by radicals?, One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model, A generalisation of the Cantor-Zassenhaus algorithm, Computer construction of split Cartan subalgebras, Univariate polynomial factorization over finite fields, An effective description of the roots of bivariates mod pk and the related Igusaâs local zeta function, New Sparse Multivariate Polynomial Factorization Algorithms over Integers, SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption, Accelerating the Delfs-Galbraith algorithm with fast subfield root detection, Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata over \(\mathbb{Z}_p\), Cryptographic Applications of Capacity Theory: On the Optimality of Coppersmithâs Method for Univariate Polynomials, Univariate polynomial factorization over finite fields with large extension degree, Computing primitive idempotents in finite commutative rings and applications, \textsc{Rings}: an efficient Java/Scala library for polynomial rings, Interval partitions and polynomial factorization, On Bivariate Polynomial Factorization over Finite Fields, On arithmetical algorithms over finite fields, On the deterministic complexity of factoring polynomials over finite fields, Analysis of Euclidean algorithms for polynomials over finite fields, Factoring polynomials using fewer random bits, Is every matrix similar to a polynomial in a companion matrix?, Computing isomorphisms and embeddings of finite fields, On splitting sets in block designs and finding roots of polynomials, Using the theory of cyclotomy to factor cyclotomic polynomials over finite fields, Computing conjugating sets and automorphism groups of rational functions, Improving the algorithms of Berlekamp and Niederreiter for factoring polynomials over finite fields, Efficiently factoring polynomials modulo \(p^4\), A heuristic irreducibility test for univariate polynomials, A verified implementation of the Berlekamp-Zassenhaus factorization algorithm, Computing explicit isomorphisms with full matrix algebras over \(\mathbb {F}_q(x)\), Decomposition of algebras over finite fields and number fields, A note on Gröbner bases and Berlekamp's algorithm, Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields, Distinct Degree Factorizations for Polynomials over a Finite Field, Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes, Factoring polynomials over finite fields: A survey, Subquadratic-time factoring of polynomials over finite fields, Kronecker's and Newton's approaches to solving: a first comparison, On the Complexity of the Montes Ideal Factorization Algorithm, Factoring polynomials over local fields., The black-box Niederreiter algorithm and its implementation over the binary field, Unnamed Item, Average-case linear matrix factorization and reconstruction of low width algebraic branching programs, Factoring Multivariate Polynomials over Large Finite Fields, Factoring polynomials over finite fields with Drinfeld modules, Polynomial factorization over finite fields by computing Euler-PoincarĂ© characteristics of Drinfeld modules, On a family of preimage-resistant functions, A public key cryptosystem based on Diophantine equations of degree increasing type, Generating Genus Two Hyperelliptic Curves over Large Characteristic Finite Fields, Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields, A Highly Scalable RFID Authentication Protocol, Factoring polynomials over finite fields, Fast rectangular matrix multiplication and applications, Deterministic irreducibility testing of polynomials over large finite fields, Testing isomorphism of graded algebras, Trading GRH for algebra: Algorithms for factoring polynomials and related structures, On the degrees of irreducible factors of polynomials over a finite field, Iterative root approximation in \(p\)-adic numerical analysis, Connections between the algorithms of Berlekamp and Niederreiter for factoring polynomials over \(\mathbb{F}_ q\), Algebraic algorithms in GF(q), Computing discrete logarithms in the Jacobian of high-genus hyperelliptic curves over even characteristic finite fields, The Rabin cryptosystem revisited, A Generalised Successive Resultants Algorithm, Deterministic root finding in finite fields, Polynomial factorization over ${\mathbb F}_2$
Cites Work
