Polynomial factorization over ${\mathbb F}_2$

DOI10.1090/S0025-5718-02-01421-7zbMath1001.68203MaRDI QIDQ3147181

Joachim von zur Gathen, Jürgen Gerhard

Publication date: 18 September 2002

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

zbMATH Keywords

fast algorithmsfinite fieldspolynomial factorizationFrobenius automorphism

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials over finite fields (11T06)

Related Items

Computing special powers in finite fields, Fast arithmetics in Artin-Schreier towers over finite fields, Interval partitions and polynomial factorization, Faster Multiplication in GF(2)[x], Quantum circuits for \(\mathbb F_{2^n}\)-multiplication with subquadratic gate count

Cites Work

• On arithmetical algorithms over finite fields
• On fast multiplication of polynomials over arbitrary algebras
• Counting irreducible factors of polynomials over a finite field
• Fast multiplication of polynomials over fields of characteristic 2
• A new polynomial factorization algorithm and its implementation
• Computing Frobenius maps and factoring polynomials
• Fast multiplication of large numbers
• The Computational Complexity of Continued Fractions
• A New Algorithm for Factoring Polynomials Over Finite Fields
• Factoring high-degree polynomials over $\mathbf F_2$ with Niederreiter's algorithm on the IBM SP2
• Subquadratic-time factoring of polynomials over finite fields
• Factoring a binary polynomial of degree over one million
• Factoring Polynomials Over Large Finite Fields
• Factoring polynomials over finite fields: A survey
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item