Cryptology ePrint Archive: Report 2013/362

A Fast Implementation of the Optimal Ate Pairing over BN curve on Intel Haswell Processor

Shigeo MITSUNARI

Abstract: We present an efficient implementation of the Optimal Ate Pairing on Barreto-Naehrig curve over a 254-bit prime field on Intel Haswell processor. Our library is able to compute the optimal ate pairing over a 254-bit prime field, in just 1.17 million of clock cycles on a single core of an Intel Core i7-4700MQ(2.4GHz) processor with TurboBoost technology disabled.

Category / Keywords: implementation / optimal ate pairing, efficient implementation, Haswell

Date: received 8 Jun 2013, last revised 10 Jun 2013

Contact author: herumi at nifty com

Available format(s): PDF | BibTeX Citation

Note: Append the new reference : G. C. C. F. Pereira et al. "A family of implementation-friendly BN elliptic curves"

Version: 20130611:000446 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]