par Davenport, James J.H.;Petit, Christophe ;Pring, Benjamin
Référence Lecture notes in computer science, 10064 LNCS, page (105-124)
Publication Publié, 2017
Article révisé par les pairs
Résumé : The Successive Resultants Algorithm (SRA) is a root-finding algorithm for polynomials over Fpn and was introduced at ANTS in 2014 [19]. 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.