DocumentCode
3311628
Title
Efficient Pairing Computation Based on Comb Method
Author
Zhang Bao-hua ; Yin Xin-chun
Author_Institution
Sch. of Comput. Sci., Fudan Univ., Shanghai
Volume
2
fYear
2009
fDate
25-26 April 2009
Firstpage
402
Lastpage
405
Abstract
It is well known that the Weil and Tate pairing are very time consuming computation, hence it is necessary to develop more efficient implementations of the Weil and Tate pairing for the practical application of pairing based cryptosystems proposed recently. This paper presented a new modified Miller´s algorithm for computing Weil and Tate pairing based on the comb method. Comparisons with Miller algorithm as well as other algorithms are given. Results show that the new proposed algorithm is more efficient than other algorithms.
Keywords
cryptography; comb method; elliptic curves; pairing based cryptosystems; pairing computation; Application software; Computer networks; Computer science; Computer security; Educational institutions; Elliptic curve cryptography; Elliptic curves; Galois fields; Identity-based encryption; Wireless communication; Comb method; Elliptic curves; Tate pairing; Weil pairing;
fLanguage
English
Publisher
ieee
Conference_Titel
Networks Security, Wireless Communications and Trusted Computing, 2009. NSWCTC '09. International Conference on
Conference_Location
Wuhan, Hubei
Print_ISBN
978-1-4244-4223-2
Type
conf
DOI
10.1109/NSWCTC.2009.290
Filename
4908490
Link To Document