You are not currently logged in.
Access JSTOR through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
On a New Factorization Algorithm for Polynomials Over Finite Fields
Harald Niederreiter and Rainer Göttfert
Mathematics of Computation
Vol. 64, No. 209 (Jan., 1995), pp. 347-353
Published by: American Mathematical Society
Stable URL: http://www.jstor.org/stable/2153339
Page Count: 7
You can always find the topics here!Topics: Polynomials, Factorization, Arithmetic, Algorithms, Mathematical problems, Linear algebra, Division, Algebra, Linear equations
Were these topics helpful?See something inaccurate? Let us know!
Select the topics that are inaccurate.
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
A new deterministic factorization algorithm for polynomials over finite fields was recently developed by the first author. The bottleneck in this algorithm is the last stage in which the irreducible factors of the polynomial are derived from the solutions of a system of linear equations. An efficient approach to the last stage was designed by the second author for the case of finite fields of characteristic 2. In this paper, we describe a different approach to the last stage which works for arbitrary fields of positive characteristic. In particular, we obtain in this way an acceleration of the factorization algorithm of the first author which makes this algorithm polynomial time for fixed characteristic.
Mathematics of Computation © 1995 American Mathematical Society