  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\"obner basis
algorithms.
