DocumentCode :
2674629
Title :
Improved Algorithm for Tate Pairing Computation
Author :
Wu, Ting ; Zhang, Min ; Xu, Xiaoliang ; Wang, Rongbo
Author_Institution :
Coll. of Comput., Hangzhou Dianzi Univ., Hangzhou
fYear :
2008
fDate :
3-5 Aug. 2008
Firstpage :
41
Lastpage :
45
Abstract :
In this paper, an efficient algorithm for the computation of 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.
Keywords :
cryptography; Tate pairing; binary representation; cryptographic protocol; general curve; integer; Computer security; Cryptographic protocols; Cryptography; Educational institutions; Electronic commerce; Equations; Galois fields; H infinity control; Large Hadron Collider; Miller´s algorithm; Non-adjacent form; Tate pairing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Electronic Commerce and Security, 2008 International Symposium on
Conference_Location :
Guangzhou City
Print_ISBN :
978-0-7695-3258-5
Type :
conf
DOI :
10.1109/ISECS.2008.34
Filename :
4606021
Link To Document :
بازگشت