椭圆曲线密码的三元算法

TERNARY ARITHMETIC OF ELLIPTIC CURVES CRYPTOGRAPH

基于离散对数问题的椭圆曲线公钥密码体制越来越倍受关注。在该体制中,因最耗时的运算是椭圆曲线上的点与一个整数的乘法运算,所以倍点运算的快速算法是椭圆曲线密码快速实现的关键。利用整数的有符号的三元展开,实现了椭圆曲线密码的快速算法,其效率比二元算法提高12.4%。

The public key cryptograph mechanism of elliptic curves based on discrete logarithm has attracted more and more attraction. The most time-consuming operation in the system is the multiplication of a point on the elliptic curve with an integer. Therefore the efficient computiug of mutiplying points operation is the key for efficient elliptic curve cryptography. An efficient arithmetic based on ternary expansion of an integer is presented compared with binary arithmetic ,ternary arithmetic is improved in efficiency by 12. 4%.