首页 | 本学科首页   官方微博 | 高级检索  
     


Faster computation of the Tate pairing
Authors:Christophe Arè  ne,Michael Naehrig,Christophe Ritzenthaler
Affiliation:a Institut de Mathématiques de Luminy, 163, avenue de Luminy, Case 907, 13288 Marseille CEDEX 09, France
b Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, P.O. Box 513, 5600 MB Eindhoven, Netherlands
c Microsoft Research, One Microsoft Way, Redmond, WA 98052, USA
Abstract:

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/.
Keywords:Pairings   Miller functions   Explicit formulas   Edwards curves
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号