Another Elliptic Curve Model for Faster Pairing Computation

This paper considers a model for elliptic curve named Selmer curves. We study the arithmetic of Selmer curves, which includes group operations and pairing computation. We present fast formulae for point addition and doubling. Moreover, for even embedding degree k, we show that Tate pairing computation on Selmer curves is very efficient. It is almost the fastest among that on various elliptic curve models such as Weierstrass curves, Edwards curves, Hessian curves, etc.. One more advantage which Selmer curves gain over other models is that pairing computation on this model can be performed in a parallel manner. In addition, the higher twists (up to sextic twists) technique can also be applied to Selmer curves for accelerating pairing computation. We finally present some numerical examples of pairing friendly Selmer curves which can employ sextic twists.

[1]  Kwangjo Kim,et al.  A New ID-based Group Signature Scheme from Bilinear Pairings , 2003, IACR Cryptol. ePrint Arch..

[2]  Hovav Shacham,et al.  Pairing-Based Cryptography - Pairing 2009, Third International Conference, Palo Alto, CA, USA, August 12-14, 2009, Proceedings , 2009, Pairing.

[3]  Paulo S. L. M. Barreto,et al.  Efficient Algorithms for Pairing-Based Cryptosystems , 2002, CRYPTO.

[4]  Tanja Lange,et al.  Faster Pairing Computations on Curves with High-Degree Twists , 2010, Public Key Cryptography.

[5]  Palash Sarkar,et al.  Pairing Computation on Twisted Edwards Form Elliptic Curves , 2008, Pairing.

[6]  Tanja Lange,et al.  Faster Computation of the Tate Pairing , 2009, IACR Cryptol. ePrint Arch..

[7]  Aggelos Kiayias,et al.  Polynomial Reconstruction Based Cryptography , 2001, Selected Areas in Cryptography.

[8]  Jiwu Huang,et al.  A note on the Ate pairing , 2008, International Journal of Information Security.

[9]  Sanjit Chatterjee,et al.  Efficient Computation of Tate Pairing in Projective Coordinate over General Characteristic Fields , 2004, ICISC.

[10]  Nigel P. Smart,et al.  High Security Pairing-Based Cryptography Revisited , 2006, ANTS.

[11]  Dawu Gu,et al.  Efficient Pairing Computation on Elliptic Curves in Hessian Form , 2010, ICISC.

[12]  Paulo S. L. M. Barreto,et al.  Pairing-Friendly Elliptic Curves of Prime Order , 2005, Selected Areas in Cryptography.

[13]  Eiji Okamoto,et al.  Optimised Versions of the Ate and Twisted Ate Pairings , 2007, IMACC.

[14]  Nigel P. Smart,et al.  The Hessian Form of an Elliptic Curve , 2001, CHES.

[15]  Choonsik Park,et al.  Information Security and Cryptology - ICISC 2004, 7th International Conference, Seoul, Korea, December 2-3, 2004, Revised Selected Papers , 2005, ICISC.

[16]  Yuliang Zheng,et al.  Advances in Cryptology — ASIACRYPT 2002 , 2002, Lecture Notes in Computer Science.

[17]  Craig Gentry,et al.  Hierarchical ID-Based Cryptography , 2002, ASIACRYPT.

[18]  Victor S. Miller,et al.  The Weil Pairing, and Its Efficient Calculation , 2004, Journal of Cryptology.

[19]  Michael Scott,et al.  A Taxonomy of Pairing-Friendly Elliptic Curves , 2010, Journal of Cryptology.

[20]  Antoine Joux,et al.  A One Round Protocol for Tripartite Diffie–Hellman , 2000, Journal of Cryptology.

[21]  Hovav Shacham,et al.  Short Group Signatures , 2004, CRYPTO.

[22]  Colin Boyd,et al.  Cryptography and Coding , 1995, Lecture Notes in Computer Science.

[23]  Ernst S. Selmer,et al.  The diophantine equationax3+by3+cz3=0. , 1951 .

[24]  Colin Boyd,et al.  Faster Pairings on Special Weierstrass Curves , 2009, Pairing.

[25]  Marc Joye,et al.  Efficient Arithmetic on Hessian Curves , 2010, Public Key Cryptography.

[26]  Hovav Shacham,et al.  Aggregate and Verifiably Encrypted Signatures from Bilinear Maps , 2003, EUROCRYPT.

[27]  Moti Yung,et al.  Advances in Cryptology — CRYPTO 2002 , 2002, Lecture Notes in Computer Science.

[28]  Aggelos Kiayias,et al.  Multi-query Computationally-Private Information Retrieval with Constant Communication Rate , 2010, Public Key Cryptography.

[29]  Katherine E. Stange The Tate Pairing Via Elliptic Nets , 2007, Pairing.

[30]  Bao Li,et al.  Pairing Computation on Elliptic Curves of Jacobi Quartic Form , 2010, IACR Cryptol. ePrint Arch..

[31]  Frederik Vercauteren,et al.  Optimal Pairings , 2010, IEEE Transactions on Information Theory.

[32]  Steven D. Galbraith,et al.  Pairing-Based Cryptography - Pairing 2008, Second International Conference, Egham, UK, September 1-3, 2008. Proceedings , 2008, Pairing.

[33]  Tsuyoshi Takagi,et al.  Pairing-Based Cryptography - Pairing 2007, First International Conference, Tokyo, Japan, July 2-4, 2007, Proceedings , 2007, Pairing.

[34]  Jeffrey Shallit,et al.  Algorithmic Number Theory , 1996, Lecture Notes in Computer Science.

[35]  Mehdi Tibouchi,et al.  Huff's Model for Elliptic Curves , 2010, ANTS.

[36]  Paulo S. L. M. Barreto,et al.  On the Selection of Pairing-Friendly Groups , 2003, Selected Areas in Cryptography.

[37]  Marc Joye,et al.  Hessian Elliptic Curves and Side-Channel Attacks , 2001, CHES.

[38]  Vincent Rijmen,et al.  Progress in Cryptology - INDOCRYPT 2008, 9th International Conference on Cryptology in India, Kharagpur, India, December 14-17, 2008. Proceedings , 2008, INDOCRYPT.

[39]  Matthew Franklin,et al.  Advances in Cryptology – CRYPTO 2004 , 2004, Lecture Notes in Computer Science.

[40]  Jean-Pierre Serre A Course in Arithmetic , 1973 .

[41]  Matthew K. Franklin,et al.  Identity-Based Encryption from the Weil Pairing , 2001, CRYPTO.

[42]  Antoine Joux,et al.  Another Approach to Pairing Computation in Edwards Coordinates , 2008, INDOCRYPT.