Factoring High-Degree Polynomials Over F<sub>2</sub> with Niederreiter's Algorithm on th...
<p>A C implementation of Niederreiter's algorithm for factoring polynomials over F<sub>2</sub> is described. The most time-consuming part of this algorithm, which consists of setting up and solving a certain system of linear equations, is performed in parallel....
|Journal Title:||Mathematics of Computation|
|Authors and Corporations:|
|In:||Mathematics of Computation, 68, 1999, 226, p. 869-880|
|Type of Resource:||Electronic Article|
American Mathematical Society