A method for efficient parallel computation of Tate pairing. (2nd March 2012)

• Record Type: Journal Article
• Authors: Su, Zhitu; Sun, Chunhui; Li, Hui; Ma, Jianfeng
• Is Part Of: International journal of grid and utility computing. Volume 3:Number 1(2012)
• Page Start: 43
• Page End: 52
• Publication Date: 2012-03-02
• Subjects: Tate pairing -- parallel computation -- multi-core -- Miller's algorithm; Electronic data processing -- Distributed processing -- Periodicals; Electronic commerce -- Management -- Computer programs -- Periodicals; 004.605
• Languages: English
• ISSNs: 1741-847X

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%.