arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1002.2597math.NT
收藏

小特征正常椭圆曲线同构的快速算法

Fast algorithms for computing isogenies between ordinary elliptic curves in small characteristic

Luca De Feo

摘要:

计算F_q上两条给定椭圆曲线之间的显式等距的问题,最初是由点计数引起的,最近由于Teske和Rostovstev & Stolbunov的工作,在密码学界引起了新的兴趣。虽然大特征的情况下是很好地理解,只有次优算法是已知的小特征;他们是由于Couveignes,Lercier,Lercier & Joux和Lercier & Sirvent。在本文中,我们讨论了它们之间的差异,并进行了一些比较实验。我们还提出了第一个完整的实现Couveignes的第二个算法,并提出了改进,使其算法具有最好的渐近复杂度的isqueries。

英文摘要:

The problem of computing an explicit isogeny between two given elliptic curves over F_q, originally motivated by point counting, has recently awaken new interest in the cryptology community thanks to the works of Teske and Rostovstev & Stolbunov. While the large characteristic case is well understood, only suboptimal algorithms are known in small characteristic; they are due to Couveignes, Lercier, Lercier & Joux and Lercier & Sirvent. In this paper we discuss the differences between them and run some comparative experiments. We also present the first complete implementation of Couveignes' second algorithm and present improvements that make it the algorithm having the best asymptotic complexity in the degree of the isogeny.

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

↑