loading...
Improved Algorithm for Tate Pairing Computation
August 03-August 05
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISECS.2008.342008 International Symposium on Elect ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
In this paper, an efficient algorithm for the computationof Tate pairing on general curves is presented. Our approach is to change the binary representation of the involved integer to its non–adjacent form at first, and then pre–organize this form to make further improvement on its efficiency. We also show this algorithm has better performance than BMX and LHC algorithms.
Index Terms:
Tate pairing, Miller's algorithm, Non-adjacent form
Citation:
Ting Wu, Min Zhang, Xiaoliang Xu, Rongbo Wang, "Improved Algorithm for Tate Pairing Computation," isecs, pp.41-45, 2008 International Symposium on Electronic Commerce and Security, 2008
Usage of this product signifies your acceptance of the Terms of Use.