A note on the factorization method of Niederreiter

Authors:
Sangtae Jeong;Young-Ho Park
Affiliations:
Department of Mathematics, Inha University, Incheon 402-751, Republic of Korea;Department of Information Security, Sejong Cyber University, Seoul 143-150, Republic of Korea
Venue:
Finite Fields and Their Applications
Year:
2005

Citing 8
Cited 0

Solving sparse linear equations over finite fields

IEEE Transactions on Information Theory
Factoring polynomials over finite fields using differential equations and normal bases

Mathematics of Computation
On a new factorization algorithm for polynomials over finite fields

Mathematics of Computation
Comparative implementations of Berlekamp's and Niederreiter's polynomial factorization algorithms

FFA '95 Proceedings of the third international conference on Finite fields and applications
Factoring high-degree polynomials over f2 with Niederreiter's algorithm on the IBM SP2

Mathematics of Computation
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
On Wiedemann's Method of Solving Sparse Linear Systems

AAECC-9 Proceedings of the 9th International Symposium, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
The black-box Niederreiter algorithm and its implementation over the binary field

Mathematics of Computation

Quantified Score

Hi-index	0.00

Visualization

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.