Abstract
This research paper proposes new explicit formulas to compute the Tate pairing on Jacobi quartic elliptic curves. We state the first geometric interpretation of the group law on Jacobi quartic curves by presenting the functions which arise in the addition and doubling. We draw together the best possible optimization that can be used to efficiently evaluate the Tate pairing using Jacobi quartic curves. They are competitive with all published formulas for Tate pairing computation using Short Weierstrass or Twisted Edwards curves. Finally we present several examples of pairing-friendly Jacobi quartic elliptic curves which provide optimal Tate pairing.
Similar content being viewed by others
References
Arène C, Lange T, Naehrig M, Ritzenthaler M (2009) Faster computation of tate pairings. Cryptology ePrint Archive, Report 2009/155. http://eprint.iacr.org/2009/155.pdf. Accessed May 2016
Barreto PSLM (2005) Pairing-based crypto lounge. http://planeta.terra.com.br/informatica/paulobarreto/pblounge.html. Accessed May 2016
Boneh D, Franklin M (2003) Identity based encryption from the Weil pairing. SIAM J Comput 32(3):586–615
Duquesne S, Fouotsa E (2013) Tate pairing computation on Jacobis elliptic curves. In: Proceedings of the 5th international conference on pairing based cryptography, pp. 254–269 (2012)
Duquesne S, El Mrabet N, Fouotsa E (2014) Efficient computation of pairings on Jacobi quartic elliptic curves. J Math Cryptol 8(4):331–362
Freeman D, Scott M, Teske E (2006) A taxonomy of pairing-friendly elliptic curves. Cryptology ePrint Archive, Report 2006/372. http://eprint.iacr.org/2006/372.pdf. Accessed May 2016
Huseyin H, Koon-Ho Wong K, Carter G, Dawson E (2009) Jacobi quartic curves revisited. Cryptology ePrint Archive, Report 2009/312, 2009. http://eprint.iacr.org/2009/312.pdf. Accessed May 2016
Joux A (2000) A one round protocol for tripartite Diffie-Hellman. ANTS-IV: 4th International symposium on algorithmic number theory, vol 1883. lecture notes in computer science. Springer, Berlin, pp 385–394
Koblitz N (1987) Elliptic curve cryptosystems. Math Comput 48(177):203–209
Miller V (1986) Use of elliptic curves in cryptography. Advances in cryptology CRYPTO 1985, vol 218. lecture notes in computer science. Springer, Berlin, pp 417–426
Miyaji A, Nakabayashi N, Takano S (2001) New explicit conditions of elliptic curve traces for FR-reduction. IEICE Trans Fundam E84–A(5):1234–1243
Sakai R, Ohgishi K, Kasahara M (2000) Cryptosystems based on pairing. In: Symposium on Cryptography and Information Security SCIS 2000
Silverman JH (1986) The arithmetic of elliptic curves, volume 106 of graduate texts in mathematics. Springer, Berlin
Wang H, Wang K, Zhang L, Li B (2011) Pairing computation on elliptic curves of Jacobi quartic form. Chin J Electron 20(4):655–661
Author information
Authors and Affiliations
Corresponding author
Appendix
Appendix
This appendix presents pairing-friendly Jacobi quartic curves. We give the script for converting a curve from the Weierstrass form to the birationally equivalent Jacobi quartic form. We also give the code for generating Kachisa-Schaefer-Scott (KSS) pairing-friendly curves with \(k=8\).
This appendix presents pairin-friendly Jacobi quartic curves. They were constructed for applications in the Tate pairing so that the curve has even order. The rho-values are stated with the curves. Notation is as before, where the number of \(\mathbb F_{p}\)-rational points on the curve is 2cr.
\(k = 8, \rho = 1.50\) following Example 6.10 in Miyaji et al. (2001):
\(k = 10, \rho = 1.49\) following Construction 6.5 in Miyaji et al. (2001):
\(k = 22, \rho = 1.39\) following Construction 6.6 in Miyaji et al. (2001):
The following is a Maple script to convert the elliptic curve in Weierstrass form to the birationally equivalent Jacobi quartic (Huseyin et al. 2009).
The following is a code in magma that can be used to find the primes p, and r for the Kachisa-Schaefer-Scott curves (KSS curves) with \(k=8\) and \(D=-3\). The cofactor c is also calculated. The KSS curves would be converted to the birationally equivalent Jacobi quartic curves.
The following code in \( {magma}\) returns a KSS curve (with \(k=8\) and \(D=-3\)), a finite field of size p, the b parameter in the elliptic curve formula, and a point G of order r. The equation of the curve is of the form of \(y^2=x^3+a\) where \(a \ne 0\).
Rights and permissions
About this article
Cite this article
Doss, S., Kaondera-Shava, R. An optimal Tate pairing computation using Jacobi quartic elliptic curves. J Comb Optim 35, 1086–1103 (2018). https://doi.org/10.1007/s10878-018-0257-y
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-018-0257-y