On the first fall degree of summation polynomials

Autor:	Kousidis Stavros, Wiemers Andreas
Jazyk:	angličtina
Rok vydání:	2019
Předmět:	polynomial systems gröbner bases discrete logarithm problem elliptic curve cryptosystem 13p15 13p10 14h52 Mathematics QA1-939
Zdroj:	Journal of Mathematical Cryptology, Vol 13, Iss 3-4, Pp 229-237 (2019)
Druh dokumentu:	article
ISSN:	1862-2976 1862-2984
DOI:	10.1515/jmc-2017-0022
Popis:	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.
Databáze:	Directory of Open Access Journals
Externí odkaz:	https://doaj.org/article/52b2b86cee424481945e06c424593400 Zobrazit plný text záznamu View record in DOAJ