Polynomial factorization over {\mathbb F}_2

DOI10.1090/S0025-5718-02-01421-7zbMATH Open1001.68203MaRDI QIDQ3147181FDOQ3147181

Authors: Joachim von zur Gathen, Jürgen Gerhard 

Publication date: 18 September 2002

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

Recommendations

• scientific article; zbMATH DE number 1254267
• Factoring a binary polynomial of degree over one million
• scientific article; zbMATH DE number 3939455
• Factoring high-degree polynomials over $\mathbf F_2$ with Niederreiter's algorithm on the IBM SP2
• scientific article; zbMATH DE number 1253982

zbMATH Keywords

finite fieldsFrobenius automorphismfast algorithmspolynomial factorization

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (13)

• Title not available (Why is that?)
• Quantum circuits for \(\mathbb F_{2^n}\)-multiplication with subquadratic gate count
• Title not available (Why is that?)
• Faster Multiplication in GF(2)[x]
• Fast arithmetics in Artin-Schreier towers over finite fields
• Title not available (Why is that?)
• Interval partitions and polynomial factorization
• Parallel Processing and Applied Mathematics
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computing special powers in finite fields
• An application of factoring

This page was built for publication: Polynomial factorization over ${\mathbb F}_2$

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3147181)