Cryptology ePrint Archive: Report 2010/363
An Analysis of Affine Coordinates for Pairing Computation
Kristin Lauter and Peter L. Montgomery and Michael Naehrig
Abstract: In this paper we analyze the use of affine coordinates for pairing computation. We observe that in many practical settings, for example when implementing optimal ate pairings in high security levels, affine coordinates are faster than using the best currently known formulas for projective coordinates. This observation relies on two known techniques for speeding up field inversions which we analyze in the context of pairing computation. We give detailed performance numbers for a pairing implementation based on these ideas, including timings for base field and extension field arithmetic with relative ratios for inversion-to-multiplication costs, timings for pairings in both affine and projective coordinates, and average timings for multiple pairings and products of pairings.
Category / Keywords: implementation / Pairing computation, Miller's algorithm, affine coordinates, optimal ate pairing, finite field inversions, pairing cost, multiple pairings, pairing products.
Publication Info: Pairing 2010
Date: received 22 Jun 2010, last revised 12 Oct 2010
Contact author: mnaehrig at microsoft com
Available format(s): PDF | BibTeX Citation
Version: 20101012:090834 (All versions of this report)
Short URL: ia.cr/2010/363
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]