본문 바로가기
KERD
논문KCI 등재

CONSTRUCTING PAIRING-FRIENDLY CURVES WITH VARIABLE CM DISCRIMINANT

2

조회

0

다운로드

0

인용

0

참고문헌

키워드

주제분류수학

초록

A new algorithm is proposed for the construction of Brezing-Weng-like elliptic curves such that polynomials de ning the CM discrim-inant are linear. Using this construction, new families of curves with variable discriminants and embedding degrees of k∈2{8, 16, 20, 24g}, which were not covered by Freeman, Scott, and Teske [9], are presented. Our re-sult is useful for constructing elliptic curves with larger and more exible discriminants.

Abstract

A new algorithm is proposed for the construction of Brezing-Weng-like elliptic curves such that polynomials de ning the CM discrim-inant are linear. Using this construction, new families of curves with variable discriminants and embedding degrees of k∈2{8, 16, 20, 24g}, which were not covered by Freeman, Scott, and Teske [9], are presented. Our re-sult is useful for constructing elliptic curves with larger and more exible discriminants.

참고문헌 (17)

  1. R. M. Avanzi, "Handbook of Elliptic and Hyperelliptic Curve Cryptography", pp.2006, Chapman & Hall
  2. R. Balasubramanian, "The improbability that an elliptic curve has subex- ponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm", J. Cryptology, 11(2), pp.141~145 (1998)
  3. P. S. L. M. Barreto, "Pairing-friendly elliptic curves of prime order, Proceedings of SAC 2005-Workshop on Selected Areas in Cryptography", Lecture Notes in Computer Science, 3897, pp.319~331 (2006), Springer-Verlag
  4. D. Boneh, "Identity-based encryption from the Weil pairing. Advances in Cryptography, Proceedings of Crypto 2001", Lecture Notes in Computer Science, 2139, pp.213~229 (2001), Springer-Verlag,
  5. D. Boneh, "Short signatures from the Weil pairing, Advances in Cryptology: Proceedings of Asiacrypt 2001", Lecture Notes in Computer Science, 2248, pp.514~532 (2002), Springer-Verlag
  6. W. Bosma, "The Magma algebra system. I. The user lan- guage", J. Symbolic Comput, 24(3), pp.235~265 (1997)
  7. F. Brezing, "Elliptic curves suitable for pairing based cryptography", Des. Codes Cryptogr, 37(1), pp.133~141 (2005)
  8. D. Freeman, "Constructing Pairing-Friendly Elliptic Curves with Embedding Degree 10, Algorithmic Number Theory Symposium ANTS-VII", Lecture Notes in Computer Sci- ence, 4076, pp.452~465 (2006), Springer-Verlag
  9. D. Freeman, "A taxonomy of pairing-friendly elliptic curves", J. Cryptology, 23(2), pp.224~280 (2010)
  10. S. Galbraith, "Ordinary abelian varieties having small embed- ding degree", Finite Fields Appl, 13(4), pp.800~814 (2007)
  11. T. W. Hungerford, "Algebra", Graduate Texts in Mathematics, 73 (1996), Springer
  12. A. Joux, "A one round protocol for tripartite Diffie-Hellman, Proceedings of Algorithmic Number Theory Symposium, ANTS-IV", Lecture Notes in Computer Science, 1838, pp.385~394 (2000), Springer-Verlag
  13. E. Kachisa, "Constructing Brezing-Weng pairing-friendly el- liptic curves using elements in the cyclotomic field, Pairing-based cryptography-Pairing 2008", Lecture Notes in Comput. Sci., 5209, pp.126~135 (2008), Springer
  14. 이향숙, "Generating Pairing-friendly curves with the cm equation of degree 1", Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5671 LNCS(0), pp.66~77, Springer Verlag
  15. R. Sakai, "Cryptosystems based on pairing", The 2000 Symposium on Cryptography and Information Security(SCIS 2000) (2000)
  16. J. H. Silverman, "The Arithmetic of Elliptic Curves" (1986), Springer-Verlag
  17. A. V. Sutherland, "Computing Hilbert class polynomials with the Chinese Remainder Theorem", Math. Comp, 80(273), pp.501~538 (2011)

관련 논문AI추천

이 간행물의 다른 논문 (19건)