On the first fall degree of summation polynomials
Combinatorics
2020-11-25 v1
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\"obner basis algorithms.
Keywords
Cite
@article{arxiv.1906.05594,
title = {On the first fall degree of summation polynomials},
author = {Stavros Kousidis and Andreas Wiemers},
journal= {arXiv preprint arXiv:1906.05594},
year = {2020}
}
Comments
12 pages, final