%0 Electronic Article %A Fleischmann, Peter and and Roelse, Peter %I American Mathematical Society %D 2003 %D 2003 %G English %@ 0025-5718 %@ 1088-6842 %~ Staatliche Kunstsammlungen Dresden, Kunstbibliothek %T The Black-Box Niederreiter Algorithm and Its Implementation over the Binary Field %V 72 %J Mathematics of Computation %V 72 %N 244 %P 1887-1899 %U https://www.jstor.org/stable/4100025 %X

The most time-consuming part of the Niederreiter algorithm for factoring univariate polynomials over finite fields is the computation of elements of the nullspace of a certain matrix. This paper describes the so-called "black-box" Niederreiter algorithm, in which these elements are found by using a method developed by Wiedemann. The main advantages over an approach based on Gaussian elimination are that the matrix does not have to be stored in memory and that the computational complexity of this approach is lower. The black-box Niederreiter algorithm for factoring polynomials over the binary field was implemented in the C programming language, and benchmarks for factoring high-degree polynomials over this field are presented. These benchmarks include timings for both a sequential implementation and a parallel implementation running on a small cluster of workstations. In addition, the Wan algorithm, which was recently introduced, is described, and connections between (implementation aspects of) Wan's and Niederreiter's algorithm are given.

%Z https://katalog.skd.museum/Record/ai-55-aHR0cHM6Ly93d3cuanN0b3Iub3JnL3N0YWJsZS80MTAwMDI1 %U https://katalog.skd.museum/Record/ai-55-aHR0cHM6Ly93d3cuanN0b3Iub3JnL3N0YWJsZS80MTAwMDI1