In this paper we analyze the use of affine coordinates for pairing computation. We observe that in many practical settings, e. g. 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.
Keywords: Pairing computation - affine coordinates - optimal ate pairing - finite field inversions - pairing cost - multiple pairings - pairing products.
|Title of host publication
|Pairing-Based Cryptography - Pairing 2010 (4th International Conference, Yamanaka Hot Spring, Japan, December 2010. Proceedings)
|M. Joye, A. Miyaji, A. Otsuka
|Place of Publication
|Published - 2010
|Lecture Notes in Computer Science