%0 Journal Article
%T FINDING SECURE ELLIPTIC CURVES OVER GF(2n) AND THEIR BASE POINTS<br>域GF(2n)上安全椭圆曲线及基点的选取
%A Liu Shengli
%A Zheng Dong
%A Wang Yumin
%A <br>刘胜利
%A 郑东
%A 王育民
%J 电子与信息学报
%D 2000
%I 
%X 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.
%K Elliptic curve cryptosystem
%K Base point
%K Trace<br>椭圆曲线密码体制
%K 基点
%K 迹
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=1319827C0C74AAE8D654BEA21B7F54D3&jid=EFC0377B03BD8D0EF4BBB548AC5F739A&aid=CBA2CB5D3BB90FBE&yid=9806D0D4EAA9BED3&vid=BC12EA701C895178&iid=94C357A881DFC066&sid=8A03DD854A27B60D&eid=CE16DE2ABCD4D365&journal_id=1009-5896&journal_name=电子与信息学报&referenced_num=0&reference_num=4