Cryptology ePrint Archive: Report 2008/205

On Software Parallel Implementation of Cryptographic Pairings

Philipp Grabher and Johann Groszschaedl and Dan Page

Abstract: A significant amount of research has focused on methods to improve the efficiency of cryptographic pairings; in part this work is motivated by the wide range of applications for such primitives. Although numerous hardware accelerators for pairing evaluation have used parallelism within extension field arithmetic to improve efficiency, similar techniques have not been examined in software thus far. In this paper we focus on parallelism within one pairing evaluation (intra-pairing), and parallelism between different pairing evaluations (inter-pairing). We identify several methods for exploiting such parallelism (extending previous results in the context of ECC) and show that it is possible to accelerate pairing evaluation by a significant factor in comparison to a naive approach.

Category / Keywords: implementation / elliptic curves, pairings

Date: received 9 May 2008, last revised 21 May 2008

Contact author: page at cs bris ac uk

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Note: updated to resolve discrepancies in performance results

Version: 20080521:065817 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]