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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish (US)
Title of host publicationISSAC 1991 - Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation
EditorsStephen M. Watt
PublisherAssociation for Computing Machinery
Pages14-21
Number of pages8
ISBN (Print)0897914376, 9780897914376
DOIs
StatePublished - Jun 1 1991
Event1991 International Symposium on Symbolic and Algebraic Computation, ISSAC 1991 - Bonn, Germany
Duration: Jul 15 1991Jul 17 1991

Publication series

NameProceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Other

Other1991 International Symposium on Symbolic and Algebraic Computation, ISSAC 1991
Country/TerritoryGermany
CityBonn
Period7/15/917/17/91

ASJC Scopus subject areas

  • Mathematics(all)

Fingerprint

Dive into the research topics of 'A fast deterministic algorithm for factoring polynomials over finite fields of small characteristic'. Together they form a unique fingerprint.

Cite this