Generating Pairing-Friendly Curves with the CM Equation of Degree 1

被引:0
作者
Lee, Hyang-Sook [1 ]
Park, Cheol-Min [1 ]
机构
[1] Ewha Womans Univ, Dept Math, Seoul 120750, South Korea
来源
PAIRING-BASED CRYPTOGRAPHY - PAIRING 2009 | 2009年 / 5671卷
关键词
ELLIPTIC-CURVES;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Refinements of the Brezing-Weng method have provided families of pairing-friendly curves with improved rho-values by using non-cyclotomic polynomials that define cyclotomic fields. We revisit these methods via a change-of-basis matrix and completely classify a basis for a. cyclotomic field to produce a family of pairing-friendly curves with a CM equation of degree 1. Using this classification, we propose a new algorithm to construct Brezing-Weng-like elliptic curves having the CM equation of degree 1, and we present new families of curves with larger discriminants.
引用
收藏
页码:66 / 77
页数:12
相关论文
共 18 条
[1]  
[Anonymous], ARXIV09032785V1
[2]  
[Anonymous], 2000, 2000 S CRYPT INF SEC
[3]  
[Anonymous], GRADUATE TEXTS MATH
[4]  
[Anonymous], TAXONOMY PAIRING FRI
[5]  
Avanzi R., 2006, Handbook of elliptic and hyperelliptic curve cryptography
[6]   The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm [J].
Balasubramanian, R ;
Koblitz, N .
JOURNAL OF CRYPTOLOGY, 1998, 11 (02) :141-145
[7]  
Barreto PSLM, 2006, LECT NOTES COMPUT SC, V3897, P319
[8]   Identity-based encryption from the Weil pairing [J].
Boneh, D ;
Franklin, M .
SIAM JOURNAL ON COMPUTING, 2003, 32 (03) :586-615
[9]  
Boneh D., 2001, LNCS, V2248, P514, DOI [10.1007/3-540-45682-130, DOI 10.1007/3-540-45682-130]
[10]   The Magma algebra system .1. The user language [J].
Bosma, W ;
Cannon, J ;
Playoust, C .
JOURNAL OF SYMBOLIC COMPUTATION, 1997, 24 (3-4) :235-265