## Abstract

New algorithms are presented for factoring polynomials of degree n over the finite field of q elements, where q is a power of 2. When log q = n^{1+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 Ω(n^{3+2a}) in this case, which corresponds to the cost of computing x^{q} modulo an n degree polynomial. The new algorithms factor an arbitrary polynomial in time O(n^{3+a+1+o(1)}+n^{2.69+1.69a}). All measures are in fixed precision operations, that is in bit complexity. Moreover, in the special case where all the irreducible factors have the same degree, the new algorithms run in time O(n^{2.69+1.69a}). In particular, one may test a polynomial for irreducibility in O(n^{2.69+1.69a}) bit operations. These results generalize to the case where q = p^{k}, where p is a small, fixed prime.

Original language | English (US) |
---|---|

Pages | 184-188 |

Number of pages | 5 |

DOIs | |

State | Published - 1997 |

Event | Proceedings of the 1997 22nd International Symposium on Symbolic and Algebraic Computation, ISSAC - Maui, HI, USA Duration: Jul 21 1997 → Jul 23 1997 |

### Other

Other | Proceedings of the 1997 22nd International Symposium on Symbolic and Algebraic Computation, ISSAC |
---|---|

City | Maui, HI, USA |

Period | 7/21/97 → 7/23/97 |

## ASJC Scopus subject areas

- General Mathematics