Finding More Non-Supersingular Elliptic Curves for Pairing-Based Cryptosystems
Finding suitable non-supersingular elliptic curves for pairing-based cryptosystems becomes an important issue for the modem public-key cryptography after the proposition of id-based encryption scheme and short signature scheme.In previous work different algorithms have been proposed for finding such elliptic curves when embedding degree k ∈ ”3, 4, 6” and cofactor h ∈ ”1, 2, 3, 4, 5”.In this paper a new method is presented to find more non-supersingular elliptic curves for pairing-based cryptosystems with general embedding degree k and large values of cofactor h.In addition, some effective parameters of these non-supersingular elliptic curves are provided in this paper.
Family of Group Order kth Root of Unity Non-Supersingular Elliptic Curves Polynomial Field
Liping XIN
the School of Electrical and Electronic Engineering,Nayyang Technological University,Yinchuan,China
国内会议
第四届信息电子与计算机工程国际会议(The 4th International Conference on Information ,Electronic and Computer Science)
泰安
英文
216-220
2012-11-24(万方平台首次上网日期,不代表论文的发表时间)