Finding roots in Fpn with the successive resultants algorithm
(2014) London Mathematical Society. Journal of Computation and Mathematics — Vol. 17, n° SPEC. ISSUE A, p. 203-217 (2014)
Files
Findingroots.pdf
Restricted Access - Adobe PDF
- 658.41 KB
Details
- Authors
- Abstract
- The problem of solving polynomial equations over finite fields has many applications in cryptography and coding theory. In this paper, we consider polynomial equations over a 'large' finite field with a 'small' characteristic. We introduce a new algorithm for solving this type of equations, called the successive resultants algorithm (SRA). SRA is radically different from previous algorithms for this problem, yet it is conceptually simple. A straightforward implementation using Magma was able to beat the built-in Roots function for some parameters. These preliminary results encourage a more detailed study of SRA and its applications. Moreover, we point out that an extension of SRA to the multivariate case would have an important impact on the practical security of the elliptic curve discrete logarithm problem in the small characteristic case. Supplementary materials are available with this article. © 2014 The Author.
- Affiliations
Citations
Petit, C. (2014). Finding roots in Fpn with the successive resultants algorithm. London Mathematical Society. Journal of Computation and Mathematics, 17(SPEC. ISSUE A), 203-217. https://doi.org/10.1112/S1461157014000138 (Original work published 2014)