arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0902.4670math.NT
收藏

Computing the endomorphism ring of an ordinary elliptic curve over a finite field

Gaetan Bisson, Andrew V. Sutherland

英文摘要:

We present two algorithms to compute the endomorphism ring of an ordinary elliptic curve E defined over a finite field F_q. Under suitable heuristic assumptions, both have subexponential complexity. We bound the complexity of the first algorithm in terms of log q, while our bound for the second algorithm depends primarily on log |D_E|, where D_E is the discriminant of the order isomorphic to End(E). As a byproduct, our method yields a short certificate that may be used to verify that the endomorphism ring is as claimed.

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

↑