Paper 2008/205
On Software Parallel Implementation of Cryptographic Pairings
Philipp Grabher, 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.
Note: updated to resolve discrepancies in performance results
Metadata
- Available format(s)
-
PDF
PS
- Category
- Implementation
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- elliptic curvespairings
- Contact author(s)
- page @ cs bris ac uk
- History
- 2008-05-21: last of 2 revisions
- 2008-05-13: received
- See all versions
- Short URL
- https://ia.cr/2008/205
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2008/205,
author = {Philipp Grabher and Johann Groszschaedl and Dan Page},
title = {On Software Parallel Implementation of Cryptographic Pairings},
howpublished = {Cryptology {ePrint} Archive, Paper 2008/205},
year = {2008},
url = {https://eprint.iacr.org/2008/205}
}
