Factoring high-degree polynomials over $\mathbf F_2$ with Niederreiter's algorithm on the IBM SP2

DOI10.1090/S0025-5718-99-01008-XzbMath1042.11084MaRDI QIDQ4235525

Peter Roelse

Publication date: 22 March 1999

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

zbMATH Keywords

polynomial factorizationparallel computingFinite fields

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06) Software, source code, etc. for problems pertaining to number theory (11-04)

Related Items (6)

Faster Multiplication in GF(2)[x] ⋮ Factoring polynomials over finite fields: A survey ⋮ A new sparse Gaussian elimination algorithm and the Niederreiter linear system for trinomials over \(\mathbb F_2\) ⋮ A note on the factorization method of Niederreiter ⋮ The black-box Niederreiter algorithm and its implementation over the binary field ⋮ Polynomial factorization over ${\mathbb F}_2$

Cites Work

• On arithmetical algorithms over finite fields
• A new polynomial factorization algorithm and its implementation
• The Computational Complexity of Continued Fractions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Factoring high-degree polynomials over $\mathbf F_2$ with Niederreiter's algorithm on the IBM SP2