Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

167

Voted

ISSAC
1997
Springer

138views Mathematics» more ISSAC 1997»

Fast Polynomial Factorization Over High Algebraic Extensions of Finite Fields

15 years 10 months ago

Fast Polynomial Factorization Over High Algebraic Extensions of Finite Fields

Download www4.ncsu.edu

New algorithms are presented for factoring polynomials of degree n over the ﬁnite ﬁeld of q elements, where q is a power of a ﬁxed prime number. When log q = n1+a , where a > 0 is constant, these algorithms are asymptotically faster than previous known algorithms, the fastest of which required time Ω(n(log q)2 ),† or Ω(n3+2a ) in this case, which corresponds to the cost of computing xq modulo an n degree polynomial. The new algorithms factor an arbitrary polynomial in time O(n3+a+o(1)

Erich Kaltofen, Victor Shoup

Real-time Traffic

ISSAC 1997 | Mathematics | Polynomial | Prime Number | ﬁnite ﬁeld |

claim paper

Related Content

» Factoring Polynomials over Finite Fields using Balance Test

» On factorization of multivariate polynomials over algebraic number and function fields

» Simultaneous Modular Reduction and Kronecker Substitution for Small Finite Fields

» Fast arithmetics in artinschreier towers over finite fields

» Trading GRH for algebra algorithms for factoring polynomials and related structures

» A New Representation of Elements of Finite Fields GF2m Yielding Small Complexity Arithmeti...

» FFPACK finite field linear algebra package

» An Identification Scheme Based on Sparse Polynomials

» Cryptographic Applications of Sparse Polynomials over Finite Rings

Post Info
More Details (n/a)

Added	08 Aug 2010
Updated	08 Aug 2010
Type	Conference
Year	1997
Where	ISSAC
Authors	Erich Kaltofen, Victor Shoup

Comments (0)