Cryptology ePrint Archive: Report 2012/232

Implementing Pairings at the 192-bit Security Level

Diego F. Aranha and Laura Fuentes-Castañeda and Edward Knapp and 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.

Category / Keywords: implementation / Pairing-based cryptography, parallel algorithm, efficient software implementation

Publication Info: Full version of paper to appear on Pairing 2012

Date: received 25 Apr 2012

Contact author: dfaranha at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20120430:153403 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]