On the first fall degree of summation polynomials
Kousidis Stavros, Wiemers Andreas
Journal of Mathematical Cryptology · 2019
doi:10.1515/jmc-2017-0022 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
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.
Abstract licence: CC BY-NC-ND
References14
14 more references, whose wording the paper’s licence keeps private.
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.