Speeding up ate pairing computation in affine coordinates

Authors:
Duc-Phong Le;Chik How Tan
Affiliations:
Temasek Laboratories, National University of Singapore, Singapore;Temasek Laboratories, National University of Singapore, Singapore
Venue:
ICISC'12 Proceedings of the 15th international conference on Information Security and Cryptology
Year:
2012

Citing 27
Cited 0

Identity-Based Encryption from the Weil Pairing

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Efficient Algorithms for Pairing-Based Cryptosystems

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
A One Round Protocol for Tripartite Diffie-Hellman

ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
Implementing the Tate Pairing

ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
The Weil Pairing, and Its Efficient Calculation

Journal of Cryptology
Elliptic Curves Suitable for Pairing Based Cryptography

Designs, Codes and Cryptography
Efficient Algorithms for Tate Pairing

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field

Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
Computing the Ate Pairing on Elliptic Curves with Embedding Degree k = 9

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves

Pairing '09 Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography
Refinements of Miller's algorithm for computing the Weil/Tate pairing

Journal of Algorithms
A Taxonomy of Pairing-Friendly Elliptic Curves

Journal of Cryptology
Fast elliptic curve algorithm combining Frobenius map and table reference to adapt to higher characteristic

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Optimal pairings

IEEE Transactions on Information Theory
New software speed records for cryptographic pairings

LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
An analysis of affine coordinates for pairing computation

Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
High-speed software implementation of the optimal ate pairing over Barreto-Naehrig curves

Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
A variant of Miller's formula and algorithm

Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
A family of implementation-friendly BN elliptic curves

Journal of Systems and Software
Faster explicit formulas for computing pairings over ordinary curves

EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Refinements of Miller's Algorithm over Weierstrass Curves Revisited

The Computer Journal
Faster squaring in the cyclotomic subgroup of sixth degree extensions

PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Faster pairing computations on curves with high-degree twists

PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Avoiding full extension field arithmetic in pairing computations

AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
Pairing-Friendly elliptic curves of prime order

SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography
On the efficient implementation of pairing-based protocols

IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
The Eta Pairing Revisited

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

At Pairing 2010, Lauter et al's analysis showed that Ate pairing computation in affine coordinates may be much faster than projective coordinates at high security levels. In this paper, we further investigate techniques to speed up Ate pairing computation in affine coordinates. We first analyze Ate pairing computation using 4-ary Miller algorithm in affine coordinates. This technique allows us to trade one multiplication in the full extension field and one field inversion for several multiplications in a smaller field. Then, we focus on pairing computations over elliptic curves admitting a twist of degree 3. We propose new fast explicit formulas for Miller function that are comparable to formulas over even twisted curves. We further analyze pairing computation on cubic twisted curves by proposing efficient subfamilies of pairing-friendly elliptic curves with embedding degrees k=9, and 15. These subfamilies allow us not only to obtain a very simple form of curve, but also lead to an efficient arithmetic and final exponentiation.