@inproceedings{3ad2ff4eca0945108ef8ec3ec8d05cba,
title = "A Generalised Successive Resultants Algorithm",
abstract = "The Successive Resultants Algorithm (SRA) is a root-finding algorithm for polynomials over Fpn and was introduced at ANTS in 2014. The algorithm is efficient when the characteristic p is small and n > 1. In this paper, we abstract the core SRA algorithm to arbitrary finite fields and present three instantiations of our general algorithm, one of which is novel and makes use of a series of isogenies derived from elliptic curves with sufficiently smooth order.",
keywords = "root finding , finite fields , algorithms , elliptic curves",
author = "Davenport, {James H} and Christophe Petit and Benjamin Pring",
note = "The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-55227-9_9; 6th International Workshop on Arithmetic of Finite Fields, WAIFI 2016 ; Conference date: 13-07-2016 Through 15-07-2016",
year = "2017",
month = mar,
day = "9",
doi = "10.1007/978-3-319-55227-9_9",
language = "English",
isbn = "978-3-319-55226-2",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "105--124",
editor = "Duquesne, {Sylvain } and Petkova-Nikova, {Svetla }",
booktitle = "Arithmetic of Finite Fields",
}