Implementing Pairings at the 192-bit Security Level

Diego F.  Aranha; Laura Fuentes-Castañeda; Edward Knapp; Alfred Menezes; Francisco Rodríguez-Henríquez

Paper 2012/232

Implementing Pairings at the 192-bit Security Level

Diego F. Aranha, Laura Fuentes-Castañeda, Edward Knapp, Alfred Menezes, and Francisco Rodríguez-Henríquez

Abstract

We implement asymmetric pairings derived from Kachisa-Schaefer-Scott (KSS), Barreto-Naehrig (BN), and Barreto-Lynn-Scott (BLS) elliptic curves at the 192-bit security level. Somewhat surprisingly, we find pairings derived from BLS curves with embedding degree 12 to be the fastest for our serial as well as our parallel implementations. Our serial implementations provide a factor-3 speedup over the previous state-of-the-art, demonstrating that pairing computation at the 192-bit security level is not as expensive as previously thought. We also present a general framework for deriving a Weil-type pairing that is well-suited for computing a single pairing on a multi-processor machine.

Metadata

Available format(s): PDF
Category: Implementation
Publication info: Published elsewhere. Full version of paper to appear on Pairing 2012
Keywords: Pairing-based cryptography parallel algorithm efficient software implementation
Contact author(s): dfaranha @ gmail com
History: 2012-04-30: received
Short URL: https://ia.cr/2012/232
License: CC BY

BibTeX

@misc{cryptoeprint:2012/232,
      author = {Diego F.  Aranha and Laura Fuentes-Castañeda and Edward Knapp and Alfred Menezes and Francisco Rodríguez-Henríquez},
      title = {Implementing Pairings at the 192-bit Security Level},
      howpublished = {Cryptology {ePrint} Archive, Paper 2012/232},
      year = {2012},
      url = {https://eprint.iacr.org/2012/232}
}