On the first fall degree of summation polynomials

Abstract

We improve on the first fall degree bound of polynomial systems that arise from a Weil descent along Semaev's summation polynomials relevant to the solution of the Elliptic Curve Discrete Logarithm Problem via Gröbner basis algorithms.

12 pages, final

References in corpus (2)

• Notes on summation polynomials
• New algorithm for the discrete logarithm problem on elliptic curves