On Software Parallel Implementation of Cryptographic Pairings

  • Philipp Grabher
  • Johann Großschädl
  • Dan Page
Conference paper

DOI: 10.1007/978-3-642-04159-4_3

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5381)
Cite this paper as:
Grabher P., Großschädl J., Page D. (2009) On Software Parallel Implementation of Cryptographic Pairings. In: Avanzi R.M., Keliher L., Sica F. (eds) Selected Areas in Cryptography. SAC 2008. Lecture Notes in Computer Science, vol 5381. Springer, Berlin, Heidelberg

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, thus far less emphasis has been placed on software exploitation of similar. 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.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Philipp Grabher
    • 1
  • Johann Großschädl
    • 1
  • Dan Page
    • 1
  1. 1.Merchant Venturers BuildingUniversity of BristolBristolUK

Personalised recommendations