DocumentCode
3055432
Title
Fast Parallel Computation of Tate Pairing
Author
Su, Zhitu ; Sun, Chunhui ; Li, Hui ; Ma, Jianfeng ; Fan, Kai
Author_Institution
Key Lab. of Comput. Networks & Inf. Security, Xidian Univ., Xi´´an, China
fYear
2011
fDate
Nov. 30 2011-Dec. 2 2011
Firstpage
178
Lastpage
183
Abstract
In pairing-based cryptography, Miller´s algorithm plays a key role in the calculation of pairing. Currently, most of the optimizations of Miller´s algorithm are of serial structure. In this paper, we propose a parallel method for efficiently computing pairing. Our method can be applied to super singular elliptic curves and ordinary elliptic curves which are suitable for pairing-based cryptography. Compared with general version of Miller´s algorithm, our method has a gain of around 50.0%.
Keywords
optimisation; parallel algorithms; public key cryptography; Miller algorithm; Tate pairing; fast parallel computation; optimization; ordinary elliptic curves; pairing-based cryptography; serial structure; singular elliptic curves; Computational efficiency; Elliptic curve cryptography; Elliptic curves; Multicore processing; Parallel processing; Protocols; Miller´s algorithm; Tate pairing; multi-core; parallel computation;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Networking and Collaborative Systems (INCoS), 2011 Third International Conference on
Conference_Location
Fukuoka
Print_ISBN
978-1-4577-1908-0
Type
conf
DOI
10.1109/INCoS.2011.93
Filename
6132796
Link To Document