Trading GRH for algebra: Algorithms for factoring polynomials and related structures

DOI10.1090/S0025-5718-2011-02505-6zbMath1239.68080OpenAlexW2103589507MaRDI QIDQ3117221

Lajos Rónyai, Nitin Saxena, Gábor Ivanyos, Marek Karpinski

Publication date: 17 February 2012

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-2011-02505-6

zbMATH Keywords

factoring polynomials over finite fieldsalgorithms without generalized Riemann hypothesiscomputing automorphismsfinding zero divisors

Mathematics Subject Classification ID

Related Items (6)

Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring ⋮ Splitting full matrix algebras over algebraic number fields. ⋮ Computing explicit isomorphisms with full matrix algebras over \(\mathbb {F}_q(x)\) ⋮ Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes ⋮ Deterministic polynomial factoring and association schemes ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factorization of solvable polynomials over finite fields and the generalized Riemann hypothesis
• Factoring polynomials modulo special primes
• Factoring polynomials and primitive elements for special primes
• Finding the radical of an algebra of linear transformations
• Computing Frobenius maps and factoring polynomials
• Complexity of ring morphism problems
• A Lie algebra method for rational parametrization of Severi-Brauer surfaces.
• Computing the structure of finite algebras
• Using the theory of cyclotomy to factor cyclotomic polynomials over finite fields
• Schemes for deterministic polynomial factoring
• Generalized riemann hypothesis and factoring polynomials over finite fields
• Finding Isomorphisms Between Finite Fields
• A Deterministic Algorithm for Factorizing Polynomials of Fq [X]
• Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
• Factoring polynomials over finite fields
• Probabilistic Algorithms in Finite Fields
• A New Algorithm for Factoring Polynomials Over Finite Fields
• Galois Groups and Factoring Polynomials over Finite Fields
• On the Efficiency of Algorithms for Polynomial Factoring
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Subquadratic-time factoring of polynomials over finite fields
• Computing Irreducible Representations of Finite Groups
• Deterministic equation solving over finite fields
• Derandomizing polynomial identity tests means proving circuit lower bounds
• Factoring polynomials over special finite fields
• On the deterministic complexity of factoring polynomials

This page was built for publication: Trading GRH for algebra: Algorithms for factoring polynomials and related structures