메뉴 건너뛰기




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

The Eta pairing revisited

Author keywords

Eta pairing; Pairing based cryptography; Tate pairing

Indexed keywords

COMPUTATIONAL METHODS; PARAMETER ESTIMATION; SECURITY OF DATA;

EID: 33846452379     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2006.881709     Document Type: Article
Times cited : (336)

References (21)
  • 2
    • 84937428623 scopus 로고    scopus 로고
    • Efficient algorithms for pairing-based cryptosystems
    • Proc. Advances in Cryptology, CRYPTO 2002
    • 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.
    • (2002) Lecture Notes in Computer Science , vol.2442 , pp. 354-369
    • Barreto, P.S.L.M.1    Kim, H.Y.2    Lynn, B.3    Scott, M.4
  • 3
    • 35248835023 scopus 로고    scopus 로고
    • Constructing elliptic curves with prescribed embedding degrees
    • Proc. Security in Communication Networks, SCN 2002, 2003
    • 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.
    • Lecture Notes in Computer Science , vol.4096 , pp. 257-267
    • Barreto, P.S.L.M.1    Lynn, B.2    Scott, M.3
  • 4
    • 33745604534 scopus 로고    scopus 로고
    • Pairing-friendly elliptic curves of prime order
    • Proc. Selected Areas in Cryptography, SAC 2005
    • 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.
    • (2006) Lecture Notes in Computer Science , vol.3897 , pp. 319-331
    • Barreto, P.S.L.M.1    Naehrig, M.2
  • 6
    • 0037623983 scopus 로고    scopus 로고
    • Identity based encryption from the Weil pairing
    • D. Boneh and M. Franklin, "Identity based encryption from the Weil pairing," SIAM J. Comput., vol. 32, pp. 586-615, 2003.
    • (2003) SIAM J. Comput , vol.32 , pp. 586-615
    • Boneh, D.1    Franklin, M.2
  • 7
    • 84946840347 scopus 로고    scopus 로고
    • Short signatures from the Weil pairing
    • Proc. Advances in Cryptology, Asiacrypt 2001
    • 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.
    • (2001) Lecture Notes in Computer Science , vol.2248 , pp. 514-532
    • Boneh, D.1    Lynn, B.2    Shacham, H.3
  • 8
    • 23944463638 scopus 로고    scopus 로고
    • Elliptic curves suitable for pairing based cryptography
    • F. Brezing and A. Weng, "Elliptic curves suitable for pairing based cryptography," Designs, Codes Crypt., vol. 37, pp. 133-141, 2005.
    • (2005) Designs, Codes Crypt , vol.37 , pp. 133-141
    • Brezing, F.1    Weng, A.2
  • 9
  • 11
    • 33947355556 scopus 로고    scopus 로고
    • 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.
    • 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
    • 82955246861 scopus 로고    scopus 로고
    • Implementing the Tate pairing
    • Proc. Algorithmic Number Theory Symposium, ANTS V
    • 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.
    • (2002) Lecture Notes in Computer Science , vol.2369 , pp. 324-337
    • Galbraith, S.1    Harrison, K.2    Soldera, S.3
  • 13
    • 79957797091 scopus 로고    scopus 로고
    • Faster point multiplication on elliptic curves with efficient endomorphisms
    • Proc. Advances in Cryptology, CRYPTO 2001
    • 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.
    • (2001) Lecture Notes in Computer Science , vol.2139 , pp. 190-200
    • Gallant, R.P.1    Lambert, R.J.2    Vanstone, S.A.3
  • 14
    • 33746734238 scopus 로고    scopus 로고
    • High security pairing-based cryptography revisited
    • Proc. Algorithmic Number Theory Symp, ANTS-7, 2006
    • 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.
    • Lecture Notes in Computer Science , vol.4096 , pp. 480-494
    • Granger, R.1    Page, D.2    Smart, N.P.3
  • 15
    • 18244402163 scopus 로고    scopus 로고
    • Implementation of cryptosystems based on Tate pairing
    • 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.
    • (2005) J. Comput. Sci. Technol , vol.20 , pp. 264-269
    • Hu, L.1    Dong, J.-W.2    Pei, D.-Y.3
  • 16
    • 84946844750 scopus 로고    scopus 로고
    • A one round protocol for tripartite Diffie-Hellman
    • Proc. Algorithmic Number Theory Symp, ANTS IV
    • 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.
    • (2000) Lecture Notes in Computer Science , vol.1838 , pp. 385-394
    • Joux, A.1
  • 18
    • 84974628135 scopus 로고    scopus 로고
    • The XTR public key system
    • Proc. Advances in Cryptology, CRYPTO 2000
    • 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.
    • (2000) Lecture Notes in Computer Science , vol.1880 , pp. 1-19
    • Lenstra, A.1    Verheul, E.2
  • 19
    • 31344437951 scopus 로고    scopus 로고
    • Pairing-based cryptography at high security levels, Cryptography and Coding, vol. 3796
    • 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.
    • (2005) Lecture Notes in Computer Science , pp. 13-36
    • Menezes, A.J.1    Koblitz, N.2
  • 21
    • 33947378913 scopus 로고    scopus 로고
    • On computable isomorphisms in efficient asymmetric pairing based systems
    • submitted for publication
    • N. P. Smart and F. Vercauteren, "On computable isomorphisms in efficient asymmetric pairing based systems," Discr. Appl. Math., submitted for publication.
    • Discr. Appl. Math
    • Smart, N.P.1    Vercauteren, F.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.