Computing the ate pairing on elliptic curves with embedding degree k =9

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E91-A, Issue 9, 2008, Pages 2387-2393

  Lin, Xibin ^a   Zhao, Chang An ^a,b   Zhang, Fangguo ^a,b   Wang, Yanming ^a  

^a SUN YAT SEN UNIVERSITY   (China)

^b Guangdong Key Laboratory of Information Security Technology   (China)

Author keywords

Ate pairing; Cubic twist; Denominator elimination; Final exponentiation

Indexed keywords

CRYPTOGRAPHY; GEOMETRY;

ATE PAIRING; CUBIC TWIST; DENOMINATOR ELIMINATION; ELLIPTIC CURVE; EXPONENTIATIONS; PAIRING-BASED CRYPTOGRAPHY; SECURITY LEVEL; SPEED UP;

PUBLIC KEY CRYPTOGRAPHY;

EID: 77953419135     PISSN: 09168508     EISSN: 17451337     Source Type: Journal    
DOI: 10.1093/ietfec/e91-a.9.2387     Document Type: Article

References (20)

1. A.O.L. Atkin and F. Morain, "Elliptic curves and primality proving," Math. Comput., vol.61, pp.29-68, 1993.
2. P.S.L.M. Barreto, S. Galbraith, C. Óhéigeartaigh, and M. Scott, "Efficient pairing computation on supersingular abelian varieties," Des. Codes Cryptogr., vol.42, no.3, pp.239-271, Springer-Verlag, 2007.
3. P.S.L.M. Barreto, H.Y. Kim, B. Lynn, and M. Scott, "Efficient algorithms for pairing-based cryptosystems," Crypto'2002, LNCS 2442, pp.354-368, Springer-Verlag, 2002.
4. P.S.L.M. Barreto and M. Naehrig, "Pairing-friendly elliptic curves of prime order," SAC'2005, LNCS 3897, pp.319-331, Springer-Verlag, 2006.
5. P.S.L.M. Barreto, B. Lynn, and M. Scott, "Constructing elliptic curves with prescribed embedding degrees," SCN, LNCS 2576, pp.257-267, Springer-Verlag, 2002.
6. P.S.L.M. Barreto, B. Lynn, and M. Scott, "On the selection of pairing-friendly groups," SAC'2003, LNCS 3006, pp. 17-25, Springer-Verlag, 2004.
7. F. Brezing and A. Weng, "Elliptic curves suitable for pairing based cryptography," Des. Codes Cryptogr., vol.37, no.1, pp.133-141, Springer-Verlag, 2005.
8. P. Duan, S. Cui, and C.W. Chan, "Special polynomial families for generating more suitable elliptic curves for pairing-based cryptosystems," Proc. 5th WSEAS International Conference on Electronics, Hardware, Wireless and Optical Communications (EHAC 2006), 2006.
9. p - x + d," Asiacrypt'2003, LNCS 2894, pp.111-123, Springer-Verlag, 2003.
10. D. Freedman, "Constructing pairing-friendly elliptic curves with embedding degree 10," ANTS-VH, LNCS 4076, pp.452-1165, Springer-Verlag, 2006.
11. D. Freeman, M. Scott, and E. Teske, "A taxonomy of pairing-friendly elliptic curves" Cryptology ePrint Archive, Report 2006/372.
12. R. Granger, D. Page, and N.P. Smart, "High security pairing-based cryptography, revisited" ANTS-VII, LNCS 4076, pp.480-494, Springer-Verlag, 2006.
13. D. Hankerson, A. Menezes, and S. Vanstone, Guide to elliptic curve cryptography, Springer-Verlag, New York, 2004.
14. F. Hess, N.P. Smart, and F. Vercauteren, "The eta pairing revisited," IEEE Trans. Inf. Theory, vol.52, no.10, pp.4595-4602, Oct. 2006. Also available from http://eprint.iacr.Org/2006/l 10
15. N. Koblitz and A. Menezes, "Pairing-based cryptography at high security levels" IMA Int. Conf., LNCS 3796, pp. 13-36, Springer-Verlag, 2005.
16. A.K. Lenstra, "Unbelievable security. Matching AES security using public key systems," Asiaerypt' 2001, LNCS 2248, pp.67-86, Springer-Verlag, 2001.
17. R. Lidl and H. Niederreiter, Finite Fields, Cambridge University Press, 1997.
18. S. Matsuda, N. Kanayama, F. Hess, and E. Okamoto, "Optimised versions of the ate and twisted ate pairings," 11th IMA International Conference on Cryptography and Coding, LNSC 4887, pp.302-312, Springer-Verlag, 2007.
19. A. Miyaji, M. Nakabayashi, and S. Takano, "New explicit condition of elliptic curve trace for FRreduction," IEICE Trans. Fundamentals, vol.E84-A, no.5, pp. 1234-1243, May 2001.
20. Multiprecision Integer and Rational Arithmetic C/C++ Library, http://www.shamus.ie/index.php