### Abstract

We present a new algorithm for factoring polynomials over finite fields. Our algorithm is deterministic, and its running time is "almost" quadratic when the characteristic is a small fixed prime. As such, our algorithm is asymptotically faster than previously known deterministic algorithms for factoring polynomials over finite fields of small characteristic.

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

Title of host publication | ISSAC 1991 - Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation |

Editors | Stephen M. Watt |

Publisher | Association for Computing Machinery |

Pages | 14-21 |

Number of pages | 8 |

Volume | Part F129962 |

ISBN (Print) | 0897914376, 9780897914376 |

DOIs | |

State | Published - Jun 1 1991 |

Event | 1991 International Symposium on Symbolic and Algebraic Computation, ISSAC 1991 - Bonn, Germany Duration: Jul 15 1991 → Jul 17 1991 |

### Other

Other | 1991 International Symposium on Symbolic and Algebraic Computation, ISSAC 1991 |
---|---|

Country | Germany |

City | Bonn |

Period | 7/15/91 → 7/17/91 |

### Fingerprint

### ASJC Scopus subject areas

- Mathematics(all)

### Cite this

*ISSAC 1991 - Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation*(Vol. Part F129962, pp. 14-21). Association for Computing Machinery. https://doi.org/10.1145/120694.120697

**A fast deterministic algorithm for factoring polynomials over finite fields of small characteristic.** / Shoup, Victor.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*ISSAC 1991 - Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation.*vol. Part F129962, Association for Computing Machinery, pp. 14-21, 1991 International Symposium on Symbolic and Algebraic Computation, ISSAC 1991, Bonn, Germany, 7/15/91. https://doi.org/10.1145/120694.120697

}

TY - GEN

T1 - A fast deterministic algorithm for factoring polynomials over finite fields of small characteristic

AU - Shoup, Victor

PY - 1991/6/1

Y1 - 1991/6/1

N2 - We present a new algorithm for factoring polynomials over finite fields. Our algorithm is deterministic, and its running time is "almost" quadratic when the characteristic is a small fixed prime. As such, our algorithm is asymptotically faster than previously known deterministic algorithms for factoring polynomials over finite fields of small characteristic.

AB - We present a new algorithm for factoring polynomials over finite fields. Our algorithm is deterministic, and its running time is "almost" quadratic when the characteristic is a small fixed prime. As such, our algorithm is asymptotically faster than previously known deterministic algorithms for factoring polynomials over finite fields of small characteristic.

UR - http://www.scopus.com/inward/record.url?scp=84971235488&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84971235488&partnerID=8YFLogxK

U2 - 10.1145/120694.120697

DO - 10.1145/120694.120697

M3 - Conference contribution

AN - SCOPUS:84971235488

SN - 0897914376

SN - 9780897914376

VL - Part F129962

SP - 14

EP - 21

BT - ISSAC 1991 - Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation

A2 - Watt, Stephen M.

PB - Association for Computing Machinery

ER -