arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0803.0728math.NTmath.AG
收藏

The elliptic curve discrete logarithm problem and equivalent hard problems for elliptic divisibility sequences

Kristin E. Lauter, Katherine E. Stange

英文摘要:

We define three hard problems in the theory of elliptic divisibility sequences (EDS Association, EDS Residue and EDS Discrete Log), each of which is solvable in sub-exponential time if and only if the elliptic curve discrete logarithm problem is solvable in sub-exponential time. We also relate the problem of EDS Association to the Tate pairing and the MOV, Frey-Rück and Shipsey EDS attacks on the elliptic curve discrete logarithm problem in the cases where these apply.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑