Complexity bounds on Semaev’s naive index calculus method for ECDLP

Complexity bounds on Semaev’s naive index calculus method for ECDLP

Since Semaev introduced summation polynomials in 2004, a number of studies have been devoted to improving the index calculus method for solving the elliptic curve discrete logarithm problem (ECDLP) with better complexity than generic methods such as Pollard’s rho method and the baby-step and giant-s...

Full description

Bibliographic Details
Main Authors: Yokoyama Kazuhiro, Yasuda Masaya, Takahashi Yasushi, Kogure Jun
Format: Article
Language:English
Published: De Gruyter 2020-10-01
Series:Journal of Mathematical Cryptology
Subjects:
ecdlp
summation polynomials
index calculus methods
gröbner basis computation
fall degrees
primary 94a60
secondary 14g50
Online Access:https://doi.org/10.1515/jmc-2019-0029

Internet

https://doi.org/10.1515/jmc-2019-0029

Similar Items