Speeding Up Ate Pairing Computation in Affine Coordinates

Provided by: National University of Singapore
Topic: Security
Format: PDF
At Pairing 2010, researcher's analysis showed that Ate pairing computation in affine coordinates may be much faster than projective coordinates at high security levels. In this paper, the authors further investigate techniques to speed up ate pairing computation in affine coordinates. They first analyze ate pairing computation using 4-ary miller algorithm in affine coordinates. This technique allows them to trade one multiplication in the full extension field and one field inversion for several multiplications in a smaller field.

Find By Topic