%0 Journal Article
%T Fast DBNS scalar multiplication algorithm based on halving operation<br>基于折半运算的快速双基数标量乘算法
%A YIN Xin-chun
%A ZHAO Rong
%A HOU Hong-xiang
%A XIE Li
%A <br>殷新春
%A 赵荣
%A 侯红祥
%A 谢立
%J 计算机应用
%D 2009
%I 
%X To raise the efficiency of scalar multiplication on elliptic curve, a scalar multiplication algorithm based on double base number system over binary field was improved. Firstly a fast direct computing 3^kP algorithm in field was deduced, which only needed one inversion; the new double base number chain based on 1/2 and 3 could be integrated with high-speed direct computing 3^kP and halving algorithm. Scalar multiplication based on the new chain only employed point addition, halving algorithm, triplication and direct computing 3^kP. Thus the complexity was depressed and the efficiency was improved about 70% over Dimitrov algorithm and about 10% over Wong method on the elliptic curves recommended by NIST.
%K elliptic curve cryptosystem
%K scalar multiplication
%K double base number system
%K halving algorithm<br>椭圆曲线密码体制
%K 标量乘法
%K 双基数系统
%K 折半算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=1E51E14D12A534AB7E54147891648780&yid=DE12191FBD62783C&vid=771469D9D58C34FF&iid=94C357A881DFC066&sid=9A3A88A3A0B8496C&eid=9438DF4A1CE63979&journal_id=1001-9081&journal_name=计算机应用&referenced_num=0&reference_num=18