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 relevant to the solution of the Elliptic Curve Discrete Logarithm Problem via Gröbner basis algorithms.

Note: Final

Metadata
Available format(s)
PDF
Publication info
Preprint.
Keywords
Polynomial systemsGröbner basesDiscrete 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

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},
      note = {\url{https://eprint.iacr.org/2015/1121}},
      url = {https://eprint.iacr.org/2015/1121}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.