A generalized successive resultant algorithm
The Successive Resultants Algorithm (SRA) is a root-finding algorithm for polynomials over Fpn and was introduced at ANTS in 2014 [19]. The algorithm was designed to be efficient when the characteristic p is small and n > 1. In this paper, we abstract the core SRA algorithm to arbitrary finit...
| Main Authors: | , , |
|---|---|
| Format: | Conference item |
| Published: |
International Workshop on the Arithmetic of Finite Fields
2017
|
| Summary: | The Successive Resultants Algorithm (SRA) is a root-finding algorithm for polynomials over Fpn and was introduced at ANTS in 2014 [19]. The algorithm was designed to be 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. |
|---|