Fast construction of irreducible polynomials over finite fields
From MaRDI portal
Publication:5906578
DOI10.1006/jsco.1994.1025zbMath0815.11059OpenAlexW1994173643MaRDI QIDQ5906578
Publication date: 13 October 1994
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jsco.1994.1025
complexityalgorithmfinite fieldminimal polynomialsfactorization of cyclotomic polynomialsalgorithms for testing irreducibilityfast construction of irreducible polynomials
Related Items (46)
High-order lifting and integrality certification ⋮ On division polynomial PIT and supersingularity ⋮ Faster sparse multivariate polynomial interpolation of straight-line programs ⋮ On some approximation problems concerning sparse polynomials over finite fields ⋮ Inversion Modulo Zero-Dimensional Regular Chains ⋮ An algorithm for computing the factor ring of an ideal in Dedekind domain with finite rank ⋮ Certified dense linear system solving ⋮ Sparse polynomial interpolation based on derivatives ⋮ Parallel computation of polynomial GCD and some related parallel computations over abstract fields ⋮ Computing Riemann-Roch spaces via Puiseux expansions ⋮ Modular composition modulo triangular sets and applications ⋮ Univariate polynomial factorization over finite fields ⋮ Factoring polynomials of the form \(f(x^n) \in \mathbb{F}_q [x\)] ⋮ Factorization of a class of composed polynomials ⋮ Elimination ideal and bivariate resultant over finite fields ⋮ A direct key recovery attack on SIDH ⋮ Breaking SIDH in polynomial time ⋮ Genus 2 point counting over prime fields ⋮ Univariate polynomial factorization over finite fields with large extension degree ⋮ Standard generators of finite fields and their cyclic subgroups ⋮ Fast arithmetics in Artin-Schreier towers over finite fields ⋮ Complexity bounds for the rational Newton-Puiseux algorithm over finite fields ⋮ Computing isomorphisms and embeddings of finite fields ⋮ Detecting lacunary perfect powers and computing their roots ⋮ Calculating the set of orders of elements in the finite linear groups ⋮ Computing Modular Polynomials ⋮ Fast computation of special resultants ⋮ Primality testing with Gaussian periods ⋮ Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields ⋮ Fast computation of generic bivariate resultants ⋮ A faster pseudo-primality test ⋮ Factoring polynomials over finite fields: A survey ⋮ Explicit computation of isomorphisms between finite fields ⋮ Subquadratic-time factoring of polynomials over finite fields ⋮ Computing in degree \(2^k\)-extensions of finite fields of odd characteristic ⋮ Fast arithmetic in unramified \(p\)-adic fields ⋮ On the Complexity of the Montes Ideal Factorization Algorithm ⋮ Finding paths of length \(k\) in \(O^{*}(2^k)\) time ⋮ Modular composition via factorization ⋮ Block-Krylov techniques in the context of sparse-FGLM algorithms ⋮ A parameterized view on matroid optimization problems ⋮ Computing Puiseux series: a fast divide and conquer algorithm ⋮ Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey ⋮ Concatenation of pseudorandom binary sequences ⋮ Accelerated tower arithmetic ⋮ Taking roots over high extensions of finite fields
This page was built for publication: Fast construction of irreducible polynomials over finite fields
