Cryptology ePrint Archive: Report 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.

Category / Keywords: discrete logarithm problem, elliptic curve cryptosystem

Date: received 19 Nov 2015, last revised 27 Nov 2015

Contact author: st kousidis at googlemail com

Available format(s): PDF | BibTeX Citation

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.

Version: 20151127:081944 (All versions of this report)

Short URL: ia.cr/2015/1121

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]