Paper 2015/1121 Original: eprint.iacr.org/2015/1121 ↗
On the First Fall Degree of Summation Polynomials
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.
Metadata
- Available format(s)
PDF- Publication info
- Preprint.
- History
- 2019-06-13: last updated
- 2015-11-19: published
- Short URL
- https://ia.cr/2015/1121
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2015/1121,
author = {Stavros Kousidis and Andreas Wiemers},
title = {On the First Fall Degree of Summation Polynomials},
howpublished = {Cryptology {ePrint} Archive, Paper 2015/1121},
year = {2015},
url = {https://eprint.iacr.org/2015/1121}
}