A note on the factorization method of Niederreiter

DOI10.1016/j.ffa.2004.08.002zbMath1140.11354OpenAlexW1970204199MaRDI QIDQ1779329

Young-Ho Park, Sangtae Jeong

Publication date: 1 June 2005

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ffa.2004.08.002

zbMATH Keywords

Hasse-Teichmüller derivativesNiederreiter's factorization algorithm

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)

Cites Work

• Factorization of polynomials and some linear-algebra problems over finite fields
• The digit principle
• A new efficient factorization algorithm for polynomials over small finite fields
• Solving sparse linear equations over finite fields
• Factoring high-degree polynomials over $\mathbf F_2$ with Niederreiter's algorithm on the IBM SP2
• Factoring Polynomials over Finite Fields Using Differential Equations and Normal Bases
• On a New Factorization Algorithm for Polynomials Over Finite Fields
• The black-box Niederreiter algorithm and its implementation over the binary field
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on the factorization method of Niederreiter