Faster pairings using an elliptic curve with an efficient endomorphism

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3797 LNCS, Issue , 2005, Pages 258-269

  Scott, Michael ^a  

^a DUBLIN CITY UNIVERSITY   (Ireland)

Author keywords

Pairing based cryptosystems; Tate pairing implementation

Indexed keywords

ALGORITHMS; COMPUTER PRIVACY; COMPUTER SCIENCE; CRYPTOGRAPHY; DATA PRIVACY; SECURITY OF DATA;

FASTER PAIRINGS; IDENTITY BASED ENCRYPTION (IBE); PAIRING BASED CRYPTOSYSTEMS; TATE PAIRING IMPLEMENTATION;

NETWORK PROTOCOLS;

EID: 33646843808     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11596219_21     Document Type: Conference Paper

References (23)

1. P.S.L.M. Barreto, S. Galbraith, C. O hEigeartaigh, and M. Scott. Efficient pairing computation on supersingular abelian varieties. Cryptology ePrint Archive, Report 2004/375, 2004. http://eprint.iacr.org/2004/375.
2. P.S.L.M. Barreto, H.Y. Kim, B. Lynn, and M. Scott. Efficient algorithms for pairing-based cryptosystems. In Advances in Cryptology - Crypto'2002, volume 2442 of Lecture Notes in Computer Science, pages 354-68. Springer-Verlag, 2002.
3. P.S.L.M. Barreto, B. Lynn, and M. Scott. Constructing elliptic curves with prescribed embedding degrees. In Security in Communication Networks - SCN'2002, volume 2576 of Lecture Notes in Computer Science, pages 263-273. Springer-Verlag, 2002.
4. P.S.L.M, Barreto and M. Naehrig. Pairing-friendly elliptic curves of prime order. Cryptology ePrint Archive, Report 2005/133, 2005. http://eprint.iacr.org/2005/133.
5. I. F. Blake, G. Seroussi, and N. P. Smart, editors. Advances in Elliptic Curve Cryptography, Volume 2. Cambridge University Press, 2005.
6. D. Boneh and M. Franklin. Identity-based encryption from the Weil pairing. SIAM Journal of Computing, 32(3):586-615, 2003.
7. F. Brezing and A. Weng. Elliptic curves suitable for pairing based cryptography. Cryptology ePrint Archive, Report 2003/143, 2003. Available from http://eprint.iacr.org/2003/143.
8. J. Buchmann and H. Baier. Efficient construction of cryptographically strong elliptic curves. In INDOCRYPT, pages 191-202, 2000.
9. D. Coppersmith, Fast evaluation of logarithms in fields of characteristics two. In IEEE Transactions on Information Theory, volume 30, pages 587-594, 1984.
10. R. Crandall and C. Pomerance. Prime Numbers: a Computational Perspective. Springer-Verlag, Berlin, 2001.
11. I. Duursma and H. S. Lee, Tate-pairing implementations for tripartite key agreement. In Advances in Cryptology - Asiacrypt 2003, volume 2894 of Lecture Notes in Computer Science, pages 111-123. Springer-Verlag, 2003.
12. G. Frey, M. Müller, and H. Rück, The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems. IEEE Transactions on Information Theory, 45(5):1717-1719, 1999.
13. S. Galbraith, K. Harrison, and D. Soldera. Implementing the Tate pairing. In Algorithm Number Theory Symposium - ANTS V, volume 2369 of Lecture Notes in Computer Science, pages 324-337. Springer-Verlag, 2002.
14. R.P. Gallant, R.J. Lambert, and S.A. Vanstone. Faster point multiplication on elliptic curves with efficient endomorphisms. In Advances in Cryptology - Crypto 2001, volume 2139 of Lecture Notes in Computer Science, pages 190-200. SpringerVerlag, 2001.
15. N. Koblitz and A. Menezes. Pairing-based cryptography at high security levels. Cryptology ePrint Archive, Report 2005/076, 2005. http://eprint.iacr. org/2005/076.
16. A. K. Lenstra. Unbelievable security. Matching AES security using public key systems. In Advances in Cryptology - Asiacrypt 2001, volume 2248, pages 67-86. Springer-Verlag, 2001.
17. A. Menezes. Elliptic Curve Public Key Cryptosystems. Kluwer Academic Publishers, 1993.
18. V. Miller. Short programs for functions on curves, unpublished manuscript, 1986.
19. A. Miyaji, M. Nakabayashi, and S. Takano. New explicit conditions of elliptic curve traces for FR-reduction. IEICE Transactions on Fundamentals, E84-A(5):1234-1243, 2001.
20. D. Page, N.P. Smart, and F. Vercauteren. A comparison of MNT curves and supersingular curves. Cryptology ePrint Archive, Report 2004/165, 2004. http://eprint.iacr.org/2004/165.
21. M. Scott. Computing the Tate pairing. In CT-RSA, volume 3376 of Lecture Notes in Computer Science, pages 293-304. Springer-Verlag, 2005.
22. M. Scott. Scaling security in pairing-based protocols. Cryptology ePrint Archive, Report 2005/139, 2005. http://eprint.iacr.org/2005/139.
23. M. Scott and P. Barreto. Compressed pairings. In Advances in Cryptology Crypto' 2004, volume 3152 of Lecture Notes in Computer Science, pages 140-156. Springer-Verlag, 2004. Also available from http://eprint.iacr.org/2004/032/.