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

Shigeo MITSUNARI

Paper 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.

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

Metadata

Available format(s): PDF
Category: Implementation
Publication info: Published elsewhere. Unknown where it was published
Keywords: optimal ate pairing efficient implementation Haswell
Contact author(s): herumi @ nifty com
History: 2013-06-11: last of 2 revisions; 2013-06-10: received; See all versions
Short URL: https://ia.cr/2013/362
License: CC BY

BibTeX

@misc{cryptoeprint:2013/362,
      author = {Shigeo MITSUNARI},
      title = {A Fast Implementation of the Optimal Ate Pairing over {BN} curve on Intel Haswell Processor},
      howpublished = {Cryptology {ePrint} Archive, Paper 2013/362},
      year = {2013},
      url = {https://eprint.iacr.org/2013/362}
}