Factoring Polynomials over Finite Fields Using Differential Equations and Normal Bases

DOI10.2307/2153542zbMath0797.11092OpenAlexW1996816634MaRDI QIDQ4292068

Harald Niederreiter

Publication date: 4 July 1994

Full work available at URL: https://doi.org/10.2307/2153542

zbMATH Keywords

algorithmlinearizationfinite fieldsnormal basespolynomial factorizationHasse-Teichmüller derivativesdifferential equations in rational function fields

Mathematics Subject Classification ID

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

Related Items (9)

Univariate polynomial factorization over finite fields ⋮ A note on Gröbner bases and Berlekamp's algorithm ⋮ Factoring polynomials over finite fields: A survey ⋮ New recombination algorithms for bivariate polynomial factorization based on Hensel lifting ⋮ Primitive Normal Polynomials Over Finite Fields ⋮ A note on the factorization method of Niederreiter ⋮ Primary decomposition of zero-dimensional ideals over finite fields ⋮ On a New Factorization Algorithm for Polynomials Over Finite Fields ⋮ Substitutions for linear shift register sequences and the factorization algorithms of Berlekamp and Niederreiter

Cites Work

• Optimal normal bases in \(GF(p^ n)\)
• On fast multiplication of polynomials over arbitrary algebras
• Factorization of polynomials and some linear-algebra problems over finite fields
• Factorization of polynomials over finite fields and characteristic sequences
• A new efficient factorization algorithm for polynomials over small finite fields
• An Acceleration of the Niederreiter Factorization Algorithm in Characteristic 2
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Factoring Polynomials over Finite Fields Using Differential Equations and Normal Bases