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.
|Name||Lecture Notes in Computer Science|
|Conference||6th International Workshop on Arithmetic of Finite Fields, WAIFI 2016|
|Period||13/07/16 → 15/07/16|
The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-55227-9_9
- root finding
- finite fields
- elliptic curves