Name
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. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1016/j.ffa.2004.08.002 | Finite Fields and Their Applications |
Keywords | Field | DocType |
coefficient matrix,setup cost,base field,factorization method,factorization algorithm | Combinatorics,Coefficient matrix,Algebra,Degree of a polynomial,Euler's factorization method,Incomplete LU factorization,Factorization,Dixon's factorization method,Factorization of polynomials,Mathematics,Quadratic sieve | Journal |
Volume | Issue | ISSN |
11 | 2 | 1071-5797 |
Citations | PageRank | References |
1 | 0.37 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sangtae Jeong | 1 | 29 | 3.08 |
| Young-Ho Park | 2 | 137 | 16.79 |