Constructing elliptic curve including subgroup with low hamming order

摘要：

In practical applications of pairing-based cryptosystems,the efficiency of pairing computation is a crucial factor.Recently,there have been many improvements for the computation of Tate pairing,which focuses on the arithmetical operations under given elliptic curve.Based to the characteristics that Millers algorithm will be improved tremendous if there are subgroups with order of low hamming prime above the elliptic curve,an algorithm of generating primes of low hamming with weight 3 is given in this paper.Then,we present an effective generation method of elliptic curve,which enable it feasible that there is certain some subgroup of low hamming prime order.The improvement of paring computation is marked above the elliptic curve generating by our method.

关键词： Pairing-based cryptosystems Millers algorithm Prime Test Elliptic curve

作者: Maocai Wang Hanping Hu Guangming Dai Lei Pen

作者单位: School of Computer, China University of Geosciences, Wuhan, P.R. China Institute for Pattern Recogni Institute for Pattern Recognition and Artificial Intelligence , Huazhong University of Science and t School of Computer, China University of Geosciences, Wuhan, P.R. China

会议类型: 国际会议

会议名称: 2010 International Conference of Environment Materials and Environment Management(2010年环境材料与环境管理国际学术会议 EMEM 2010)

会议地点: 哈尔滨

会议语种:英文

页码: 6-9

在线出版日期: 2010-07-24（万方平台首次上网日期，不代表论文的发表时间）