摘要
该文系统地介绍了如何利用Weil定理来寻找特征为2的域上的安全椭圆曲线。提出了一种求曲线的基点的算法。求基点的算法中涉及求域元素的迹的问题。该文在最后还提出了一种求域GF(2~l)的扩域GF(2^(lk))上元素的迹的快速实现方法。
This paper systematically introduces how to find secure elliptic curves with the help of Weil theorem, and proposes an algorithm to find base points in the curves. Finally, an efficient method of finding the trace of any element in GF(2lk), which is involved in the algorithm of finding base points, is given.
基金
陕西省自然科学基金
编号98x04
关键词
椭圆曲线
密码体制
基点
迹
Elliptic curve cryptosystem, Base point, Trace
