Faster computation of the Tate pairing

Journal of Number Theory(2011)

引用 111|浏览43
暂无评分
摘要
Text. This paper proposes new explicit formulas for the doubling and addition steps in Miller's algorithm to compute the Tate pairing on elliptic curves in Weierstrass and in Edwards form. For Edwards curves the formulas come from a new way of seeing the arithmetic. We state the first geometric interpretation of the group law on Edwards curves by presenting the functions which arise in addition and doubling. The Tate pairing on Edwards curves can be computed by using these functions in Miller's algorithm. Computing the sum of two points or the double of a point and the coefficients of the corresponding functions is faster with our formulas than with all previously proposed formulas for pairings on Edwards curves. They are even competitive with all published formulas for pairing computation on Weierstrass curves. We also improve the formulas for Tate pairing computation on Weierstrass curves in Jacobian coordinates. Finally, we present several examples of pairing-friendly Edwards curves. Video. For a video summary of this paper, please click here or visit http://www.youtube.com/watch?v=nideQo-K9ME/. (C) 2010 Elsevier Inc. All rights reserved.
更多
查看译文
关键词
Pairings,Miller functions,Explicit formulas,Edwards curves
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要