### Abstract

In this paper we develop a general technique to eliminate the assumption of the Generalized Riemann Hypothesis (GRH) from various deterministic polynomial factoring algorithms over finite fields. It is the first bona fide progress on that issue for more than 25 years of study of the problem. Our main results are basically of the following form: either we construct a nontrivial factor of a given polynomial or compute a nontrivial automorphism of the factor algebra of the given polynomial. Probably the most notable application of such automorphisms is efficiently finding zero divisors in noncommutative algebras. The proof methods used in this paper exploit virtual roots of unity and lead to efficient actual polynomial factoring algorithms in special cases.

Original language | English |
---|---|

Pages (from-to) | 493-531 |

Number of pages | 39 |

Journal | Mathematics of Computation |

Volume | 81 |

Issue number | 277 |

DOIs | |

Publication status | Published - Dec 1 2011 |

### Fingerprint

### ASJC Scopus subject areas

- Algebra and Number Theory
- Computational Mathematics
- Applied Mathematics

### Cite this

*Mathematics of Computation*,

*81*(277), 493-531. https://doi.org/10.1090/S0025-5718-2011-02505-6