An Acceleration of the Niederreiter Factorization Algorithm in Characteristic 2

DOI10.2307/2153543zbMath0797.11093OpenAlexW2163694169MaRDI QIDQ4292069

Rainer Göttfert

Publication date: 1 June 1994

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

Full work available at URL: https://semanticscholar.org/paper/2aedc2173f4a455772a6e140317e3a97d152238c

zbMATH Keywords

finite fieldsfactorization algorithmpolynomial factorizationcharacteristic 2

Mathematics Subject Classification ID

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

Related Items (4)

Univariate polynomial factorization over finite fields ⋮ COMMUNICATION BALANCING IN THE PARALLEL GÖTTFERT ALGORITHM ⋮ Factoring Polynomials over Finite Fields Using Differential Equations and Normal Bases ⋮ On a New Factorization Algorithm for Polynomials Over Finite Fields

This page was built for publication: An Acceleration of the Niederreiter Factorization Algorithm in Characteristic 2