Implementing cryptographic pairings over barreto-naehrig curves

  • Authors:
  • Augusto Jun Devegili;Michael Scott;Ricardo Dahab

  • Affiliations:
  • Instituto de Computação, Universidade Estadual de Campinas, Campinas, SP, Brazil;School of Computing, Dublin City University, Dublin 9, Ireland;Instituto de Computação, Universidade Estadual de Campinas, Campinas, SP, Brazil

  • Venue:
  • Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we describe an efficient implementation of the Tate and Ate pairings using Barreto-Naehrig pairing-friendly curves, on both a standard PC and on a 32-bit smartcard. First we introduce a subfamily of such curves with a particularly simple representation. Next we consider the issues that arise in the efficient implemention of field arithmetic in F p12, which is crucial to good performance. Various optimisations are suggested, including a novel approach to the 'final exponentiation', which is faster and requires less memory than the methods previously recommended.