  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.

Number Theory;Algebraic Geometry