摘要
文章分析了仅适用于特征为2和3的域上的一种椭圆曲线求阶算法—Madsen求阶算法,并对此算法进行了改进和推广,提高了Madsen算法的运算速度。
In this paper, the Madsen algorithm for counting points of elliptic curves over characteristic 2 and 3 finite fields based on isogeny mapping is described. And then improvement and extension of the algorithm on characteristic more than 2 are proposed. The improved algorithm is faster than the original one.
出处
《信息安全与通信保密》
2007年第9期159-161,164,共4页
Information Security and Communications Privacy
