%0 Journal Article
%T A Multiple Scalar Multiplications Algorithm in the Elliptic Curve Cryptosystem<br>椭圆曲线密码中一种多标量乘算法
%A CHEN Hou-You
%A MA Chuan-Gui
%A <br>陈厚友
%A 马传贵
%J 软件学报
%D 2011
%I 
%X The main operations of elliptic curve cryptosystems (ECCs) are scalar multiplications and multi-scalar multiplications, which heavily determined the overall implementation of the efficiency of ECC. This algorithm extends the fixed-base window method by using the signed integer factorial expansions of scalar. The main characteristic of this method is that only a point addition computation is required, and it greatly improves the computational performance of a multi-scalar. Furthermore, the correctness proof and complexity analysis of the new algorithm are presented. At last, experimental results show that the computational efficiency increases about 47.8% to 56.5% when compared with other existing methods in the case m=2.
%K point multiplication
%K multi-scalar multiplication
%K factorial expansion
%K T-multi-scalar multiplication
%K fixed-base window method<br>点乘
%K 多标量乘
%K 阶乘展开式
%K T-形多标量乘
%K 固定基窗口算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=2987B8CE9A680325C332A2FBCCA52867&yid=9377ED8094509821&vid=BC12EA701C895178&iid=E158A972A605785F&sid=B75DC817262E20A8&eid=E339BF74025BB291&journal_id=1000-9825&journal_name=软件学报&referenced_num=0&reference_num=12