International Conference on Pairing-Based Cryptography

Pairing 2010: Pairing-Based Cryptography - Pairing 2010 pp 21-39

High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves

  • Jean-Luc Beuchat
  • Jorge E. González-Díaz
  • Shigeo Mitsunari
  • Eiji Okamoto
  • Francisco Rodríguez-Henríquez
  • Tadanori Teruya
Conference paper

DOI: 10.1007/978-3-642-17455-1_2

Volume 6487 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Beuchat JL., González-Díaz J.E., Mitsunari S., Okamoto E., Rodríguez-Henríquez F., Teruya T. (2010) High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves. In: Joye M., Miyaji A., Otsuka A. (eds) Pairing-Based Cryptography - Pairing 2010. Pairing 2010. Lecture Notes in Computer Science, vol 6487. Springer, Berlin, Heidelberg

Abstract

This paper describes the design of a fast software library for the computation of the optimal ate pairing on a Barreto–Naehrig elliptic curve. Our library is able to compute the optimal ate pairing over a 254-bit prime field \(\mathbb{F}_{p}\), in just 2.33 million of clock cycles on a single core of an Intel Core i7 2.8GHz processor, which implies that the pairing computation takes 0.832msec. We are able to achieve this performance by a careful implementation of the base field arithmetic through the usage of the customary Montgomery multiplier for prime fields. The prime field is constructed via the Barreto–Naehrig polynomial parametrization of the prime p given as, p = 36t4 + 36t3 + 24t2 + 6t + 1, with t = 262 − 254 + 244. This selection of t allows us to obtain important savings for both the Miller loop as well as the final exponentiation steps of the optimal ate pairing.

Keywords

Tate pairing optimal pairing Barreto–Naehrig curve ordinary curve finite field arithmetic bilinear pairing software implementation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Jean-Luc Beuchat
    • 1
  • Jorge E. González-Díaz
    • 2
  • Shigeo Mitsunari
    • 3
  • Eiji Okamoto
    • 1
  • Francisco Rodríguez-Henríquez
    • 2
  • Tadanori Teruya
    • 1
  1. 1.Graduate School of Systems and Information EngineeringUniversity of TsukubaTsukubaJapan
  2. 2.Computer Science DepartmentCentro de Investigación y de Estudios Avanzados del IPNMéxico CityMéxico
  3. 3.Akasaka Twin Tower East 15FCybozu Labs, Inc.Minato-ku