The Eta pairing revisited

IEEE Transactions on Information Theory

Volumn 52, Issue 10, 2006, Pages 4595-4602

  Hess, Florian ^a   Smart, Nigel P ^b   Vercauteren, Frederik ^c  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b Department of Computer Science ^*  (United Kingdom)

^c UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

Eta pairing; Pairing based cryptography; Tate pairing

Indexed keywords

COMPUTATIONAL METHODS; PARAMETER ESTIMATION; SECURITY OF DATA;

ETA PAIRING; PAIRING BASED CRYPTOGRAPHY; TATE PAIRING;

ALGORITHMS;

EID: 33846452379     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2006.881709     Document Type: Article

References (21)

1. P. S. L. M. Barreto, S. Galbraith, C. O'hEigeartaigh, and M. Scott, "Efficient pairing computation on supersingular Abelian varieties," Designs, Codes and Cryptography, 2005, to be published.
2. P. S. L. M. Barreto, H. Y. Kim, B. Lynn, and M. Scott, "Efficient algorithms for pairing-based cryptosystems," in Proc. Advances in Cryptology - CRYPTO 2002, 2002, vol. 2442, Lecture Notes in Computer Science, pp. 354-369.
3. P. S. L. M. Barreto, B. Lynn, and M. Scott, "Constructing elliptic curves with prescribed embedding degrees," in Proc. Security in Communication Networks - SCN 2002, 2003, vol. 4096, Lecture Notes in Computer Science, pp. 257-267.
4. P. S. L. M. Barreto and M. Naehrig, "Pairing-friendly elliptic curves of prime order," in Proc. Selected Areas in Cryptography - SAC 2005, 2006, vol. 3897, Lecture Notes in Computer Science, pp. 319-331.
5. I. F. Blake, G. Seroussi, and N. P. Smart, Elliptic Curves in Cryptography. New York: Cambridge University Press, 1999.
6. D. Boneh and M. Franklin, "Identity based encryption from the Weil pairing," SIAM J. Comput., vol. 32, pp. 586-615, 2003.
7. D. Boneh, B. Lynn, and H. Shacham, "Short signatures from the Weil pairing," in Proc. Advances in Cryptology - Asiacrypt 2001, 2001, vol. 2248, Lecture Notes in Computer Science, pp. 514-532.
8. F. Brezing and A. Weng, "Elliptic curves suitable for pairing based cryptography," Designs, Codes Crypt., vol. 37, pp. 133-141, 2005.
9. p - x + d," in .Proc. Advances in Cryptology - ASIACRYPT 2003, 2003, vol. 2894, Lecture Notes in Computer Science, pp. 111-123.
10. P. Duan, S. Cui, and C. W. Chan, Special Polynomial Families for Generating More Suitable Elliptic Curves for Pairing-Based Cryptosystems, 2005, to be published.
11. S. Galbraith, "Pairings," in Advances in Elliptic Curve Cryptography. New York: Cambridge Univ. Press, 2005, London Math. Soc. Lecture Note Ser. 317, pp. 183-213.
12. S. Galbraith, K. Harrison, and S. Soldera, "Implementing the Tate pairing," in Proc. Algorithmic Number Theory Symposium - ANTS V, 2002, vol. 2369, Lecture Notes in Computer Science, pp. 324-337.
13. R. P. Gallant, R. J. Lambert, and S. A. Vanstone, "Faster point multiplication on elliptic curves with efficient endomorphisms," in Proc. Advances in Cryptology - CRYPTO 2001, 2001, vol. 2139, Lecture Notes in Computer Science, pp. 190-200.
14. R. Granger, D. Page, and N. P. Smart, "High security pairing-based cryptography revisited," in Proc. Algorithmic Number Theory Symp. - ANTS-7, 2006, vol. 4096, Lecture Notes in Computer Science, pp. 480-494.
15. L. Hu, J.-W. Dong, and D.-Y. Pei, "Implementation of cryptosystems based on Tate pairing," J. Comput. Sci. Technol., vol. 20, pp. 264-269, 2005.
16. A. Joux, "A one round protocol for tripartite Diffie-Hellman," in Proc. Algorithmic Number Theory Symp. - ANTS IV, 2000, vol. 1838, Lecture Notes in Computer Science, pp. 385-394.
17. V. S. Miller, Short Programs for Functions on Curves [Online]. Available: http://crypto.stanford.edu/miller/miller.pdf
18. A. Lenstra and E. Verheul, "The XTR public key system," in Proc. Advances in Cryptology - CRYPTO 2000, 2000, vol. 1880, Lecture Notes in Computer Science, pp. 1-19.
19. A. J. Menezes and N. Koblitz, "Pairing-based cryptography at high security levels," Cryptography and Coding, vol. 3796, Lecture Notes in Computer Science, pp. 13-36, 2005.
20. J. H. Silverman, The Arithmetic of Elliptic Curves. New York: Springer-Verlag, 1992.
21. N. P. Smart and F. Vercauteren, "On computable isomorphisms in efficient asymmetric pairing based systems," Discr. Appl. Math., submitted for publication.