메뉴 건너뛰기




Volumn 3006, Issue , 2004, Pages 17-25

On the selection of pairing-friendly groups

Author keywords

Elliptic curves; Group generators; Pairing based cryptosystems; Tate pairing

Indexed keywords

ALGORITHMS; PUBLIC KEY CRYPTOGRAPHY;

EID: 35048900981     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24654-1_2     Document Type: Article
Times cited : (129)

References (18)
  • 1
    • 0343736058 scopus 로고    scopus 로고
    • The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm
    • R. Balasubramanian and N. Koblitz. The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm. Journal of Cryptology, 11(2):141-145, 1998.
    • (1998) Journal of Cryptology , vol.11 , Issue.2 , pp. 141-145
    • Balasubramanian, R.1    Koblitz, N.2
  • 2
    • 84937428623 scopus 로고    scopus 로고
    • Efficient algorithms for pairing-based cryptosystems
    • Advances in Cryptology - Crypto'2002, Springer-Verlag
    • 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 377-87. Springer-Verlag, 2002.
    • (2002) Lecture Notes in Computer Science , vol.2442 , pp. 377-387
    • 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
    • Security in Communication Networks - SCN'2002, Springer-Verlag
    • 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.
    • (2002) Lecture Notes in Computer Science , vol.2576 , pp. 263-273
    • Barreto, P.S.L.M.1    Lynn, B.2    Scott, M.3
  • 5
    • 84946840347 scopus 로고    scopus 로고
    • Short signatures from the Weil pairing
    • Advances in Cryptology - Asiacrypt'2001, Springer-Verlag
    • D. Boneh, B. Lynn, and H. Shacham. Short signatures from the Weil pairing. In Advances in Cryptology - Asiacrypt'2001, volume 2248 of Lecture Notes in Computer Science, pages 514-532. Springer-Verlag, 2002.
    • (2002) Lecture Notes in Computer Science , vol.2248 , pp. 514-532
    • Boneh, D.1    Lynn, B.2    Shacham, H.3
  • 6
    • 35248901398 scopus 로고    scopus 로고
    • A secure signature scheme from bilinear maps
    • Topics in Cryptology - CT-RSA'2003, San Francisco, USA, Springer-Verlag
    • D. Boneh, I. Mironov, and V. Shoup. A secure signature scheme from bilinear maps. In Topics in Cryptology - CT-RSA'2003, volume 2612 of Lecture Notes in Computer Science, pages 98-110, San Francisco, USA, 2003. Springer-Verlag.
    • (2003) Lecture Notes in Computer Science , vol.2612 , pp. 98-110
    • Boneh, D.1    Mironov, I.2    Shoup, V.3
  • 7
    • 0021468777 scopus 로고
    • Fast evaluation of logarithms in fields of characteristics two
    • D. Coppersmith. Fast evaluation of logarithms in fields of characteristics two. In IEEE Transactions on Information Theory, volume 30, pages 587-594, 1984.
    • (1984) IEEE Transactions on Information Theory , vol.30 , pp. 587-594
    • Coppersmith, D.1
  • 8
    • 33645584409 scopus 로고    scopus 로고
    • Building curves with arbitrary small MOV degree over finite prime fields
    • R. Dupont, A. Enge, and F. Morain. Building curves with arbitrary small MOV degree over finite prime fields. Cryptology ePrint Archive, Report 2002/094, 2002. http://eprint.iacr.org/2002/094.
    • (2002) Cryptology ePrint Archive, Report 2002/094
    • Dupont, R.1    Enge, A.2    Morain, F.3
  • 10
    • 35248862491 scopus 로고    scopus 로고
    • Fast elliptic curve arithmetic and improved Weil pairing evaluation
    • Topics in Cryptology - CT-RSA'2003, Springer-Verlag
    • K. Eisentraeger, K. Lauter, and P.L. Montgomery. Fast elliptic curve arithmetic and improved Weil pairing evaluation. In Topics in Cryptology - CT-RSA'2003, volume 2612 of Lecture Notes in Computer Science, pages 343-354. Springer-Verlag, 2003.
    • (2003) Lecture Notes in Computer Science , vol.2612 , pp. 343-354
    • Eisentraeger, K.1    Lauter, K.2    Montgomery, P.L.3
  • 11
    • 84968502759 scopus 로고
    • A remark concerning m-divisibility and the discrete logarithm problem in the divisor class group of curves
    • G. Frey and H.-G. Rück. A remark concerning m-divisibility and the discrete logarithm problem in the divisor class group of curves. In Mathematics of Computation, volume 62, pages 865-874, 1994.
    • (1994) Mathematics of Computation , vol.62 , pp. 865-874
    • Frey, G.1    Rück, H.-G.2
  • 12
    • 82955246861 scopus 로고    scopus 로고
    • Implementing the Tate pairing
    • Algorithm Number Theory Symposium - ANTS V, Springer-Verlag
    • 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.
    • (2002) Lecture Notes in Computer Science , vol.2369 , pp. 324-337
    • Galbraith, S.1    Harrison, K.2    Soldera, D.3
  • 13
    • 35248849357 scopus 로고    scopus 로고
    • Efficient computations of the Tate pairing for the large MOV degrees
    • 5th International Conference on Information Security and Cryptology (ICISC 2002), Springer-Verlag
    • T. Izu and T. Takagi. Efficient computations of the Tate pairing for the large MOV degrees. In 5th International Conference on Information Security and Cryptology (ICISC 2002), volume 2587 of Lecture Notes in Computer Science, pages 283-297. Springer-Verlag, 2003.
    • (2003) Lecture Notes in Computer Science , vol.2587 , pp. 283-297
    • Izu, T.1    Takagi, T.2
  • 15
    • 84958601057 scopus 로고    scopus 로고
    • A key recovery attack on discrete log-based schemes using a prime order subgroup
    • Advances in Cryptology - Crypto'97, Springer-Verlag
    • C.H. Lim and P.J. Lee. A key recovery attack on discrete log-based schemes using a prime order subgroup. In Advances in Cryptology - Crypto'97, volume 1294 of Lecture Notes in Computer Science, pages 249-263. Springer-Verlag, 1997.
    • (1997) Lecture Notes in Computer Science , vol.1294 , pp. 249-263
    • Lim, C.H.1    Lee, P.J.2
  • 18
    • 0035336179 scopus 로고    scopus 로고
    • New explicit conditions of elliptic curve traces for FR-reduction
    • 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.
    • (2001) IEICE Transactions on Fundamentals , vol.E84-A , Issue.5 , pp. 1234-1243
    • Miyaji, A.1    Nakabayashi, M.2    Takano, S.3


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