Title: A method for efficient parallel computation of Tate pairing

Authors: Zhitu Su; Chunhui Sun; Hui Li; Jianfeng Ma

Addresses: Key laboratory of Computer Networks and Information Security, Ministry of Education, Xidian University, Xi'an, China. ' Key laboratory of Computer Networks and Information Security, Ministry of Education, Xidian University, Xi'an, China. ' Key laboratory of Computer Networks and Information Security, Ministry of Education, Xidian University, Xi'an, China. ' Key laboratory of Computer Networks and Information Security, Ministry of Education, Xidian University, Xi'an, China

Abstract: The calculation of pairing plays a key role in pairing-based cryptography. Usually, the calculation is based on Miller's algorithm. However, most of the optimisations of Miller's algorithm are of serial structure. In this paper, we propose a method to parallel compute Tate pairing efficiently. We split the divisor in Miller's algorithm into three parts. Then we use efficiently computation endomorphism and precomputation method to reduce computational cost. Compared with general version of Miller's algorithm in serial structure, our method has a gain of around 50.0%.

Keywords: Tate pairing; parallel computation; multi-core; Miller's algorithm; cryptography.

DOI: 10.1504/IJGUC.2012.045698

International Journal of Grid and Utility Computing, 2012 Vol.3 No.1, pp.43 - 52

Received: 22 Sep 2011
Accepted: 23 Sep 2011

Published online: 27 Feb 2012 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article