You are looking at a specific version 20151127:081944 of this paper. See the latest version.

Paper 2015/1121

On the First Fall Degree of Summation Polynomials

Stavros Kousidis and Andreas Wiemers

Abstract

We improve on the first fall degree bound of polynomial systems that arise from a Weil descent along Semaev's summation polynomials.

Note: Timothy J. Hodges informed us about a mistake in Corollary 4.5 in the first version of the article. Our arguments do not hold in that generality. We have re-written the relevant part, the restricted statement is now Corollary 5.2 in the second version. The statement about the first fall degree of summation polynomials remains unchanged.

Metadata
Available format(s)
PDF
Publication info
Preprint.
Keywords
discrete logarithm problemelliptic curve cryptosystem
Contact author(s)
st kousidis @ googlemail com
History
2019-06-13: last of 2 revisions
2015-11-19: received
See all versions
Short URL
https://ia.cr/2015/1121
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.