Using zeta functions to factor polynomials over finite fields

From MaRDI portal




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.











This page was built for publication: Using zeta functions to factor polynomials over finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5236842)