arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1305.2694cs.CR
收藏

Edwards曲线上Miller算法的进一步改进

Further Refinements of Miller Algorithm on Edwards curves

Duc-Phong Le, Chik How Tan

摘要:

最近,Edwards曲线由于其快速标量乘算法而在密码学界受到了广泛的关注。然后介绍了这些曲线在配对密码学中的应用。Xu和Lin(CT-RSA,2010)提出了改进Miller算法的改进方法,该算法是Edwards曲线上的核心计算配对。在本文中,我们研究了进一步的改进米勒算法。我们的方法是通用的,因此它允许计算Weil和泰特配对对配对友好的爱德华兹曲线的任何嵌入程度。分析表明,该算法比原Miller算法和Xu-Lin的改进算法都要快。

英文摘要:

Recently, Edwards curves have received a lot of attention in the cryptographic community due to their fast scalar multiplication algorithms. Then, many works on the application of these curves to pairing-based cryptography have been introduced. Xu and Lin (CT-RSA, 2010) presented refinements to improve the Miller algorithm that is central role compute pairings on Edwards curves. In this paper, we study further refinements to Miller algorithm. Our approach is generic, hence it allow to compute both Weil and Tate pairings on pairing-friendly Edwards curves of any embedding degree. We analyze and show that our algorithm is faster than the original Miller algorithm and the Xu-Lin's refinements.

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

↑