On the first fall degree of summation polynomials

Journal of mathematical cryptology

article

Stavros Kousidis¹  Andreas Wiemers¹ 

[1] Federal Office for Information Security

关键词: Polynomial systems;    Gröbner bases;    discrete logarithm problem;    elliptic curve cryptosystem;   

DOI  :  10.1515/jmc-2017-0022

学科分类：社会科学、人文和艺术（综合）

来源: De Gruyter

【 摘 要 】

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.

【 授权许可】

CC BY|CC BY-NC-ND