Using zeta functions to factor polynomials over finite fields
Number Theory
2017-10-04 v1 Algebraic Geometry
Abstract
In 2005, Kayal suggested that Schoof's algorithm for counting points on elliptic curves over finite fields might yield an approach to factor polynomials over finite fields in deterministic polynomial time. We present an exposition of his idea and then explain details of a generalization involving Pila's algorithm for abelian varieties.
Keywords
Cite
@article{arxiv.1710.00970,
title = {Using zeta functions to factor polynomials over finite fields},
author = {Bjorn Poonen},
journal= {arXiv preprint arXiv:1710.00970},
year = {2017}
}
Comments
6 pages