A Generalised Successive Resultants Algorithm

James H Davenport, Christophe Petit, Benjamin Pring

Research output: Chapter or section in a book/report/conference proceedingChapter in a published conference proceeding

1 Citation (SciVal)


The Successive Resultants Algorithm (SRA) is a root-findingalgorithm for polynomials over GF(p^n) and was introduced at ANTS in2014. The algorithm is efficient when the characteristic p is small and n > 1. In this paper, we abstract the core SRA algorithm to arbitraryfinite fields and present three instantiations of our general algorithm,one of which is novel and makes use of a series of isogenies derived fromelliptic curves with sufficiently smooth order.
Original languageEnglish
Title of host publicationArithmetic of Finite Fields - 6th International Workshop, WAIFI 2016, Revised Selected Papers
PublisherSpringer Verlag
Number of pages20
Volume10064 LNCS
ISBN (Electronic)978331955227-9
ISBN (Print)9783319552262
Publication statusE-pub ahead of print - 9 Mar 2017
EventInternational Workshop on the Arithmetic of Finite Fields (WAIFI) 2016 - Ghent, Belgium
Duration: 13 Jun 201715 Jun 2017

Publication series

NameLectures Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10064 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


WorkshopInternational Workshop on the Arithmetic of Finite Fields (WAIFI) 2016
Abbreviated titleWAIFI
Internet address


  • finite fields
  • root finding
  • algorithms
  • elliptic curves

ASJC Scopus subject areas

  • Computational Theory and Mathematics


Dive into the research topics of 'A Generalised Successive Resultants Algorithm'. Together they form a unique fingerprint.

Cite this