Article ID Journal Published Year Pages File Type
9492941 Finite Fields and Their Applications 2005 9 Pages PDF
Abstract
In this paper, we explicitly obtain the coefficient matrix arising from a linearization of Niederreiter's factorization algorithm and analyze the complexity of setting it up. It turns out that its setup cost is linear both in the degree of a polynomial to be factored and in the size of the base field.
Related Topics
Physical Sciences and Engineering Mathematics Algebra and Number Theory
Preview
A note on the factorization method of Niederreiter
Authors
, ,