摘要
文章针对椭圆曲线上点乘运算的m=2r进制等方法,利用椭圆曲线上有理点群中点P的逆元计算的特点,提出了一种改进方法。当i!2k-1时直接计算iP,当i>2k-1时计算iP=2kP-(2k-i)P,此方法比原算法中预计算阶段的计算量和存储空间均明显减少。
This paper improves on K-ary method about the numerical multiplication of the points. It is easy to calculate contrary element in the group of the rational number on elliptic curve.If i〉 2^k-1,then iP=2^kp-（2^k-i）P .This algorithm gets a 50% decrease of the space of the memory and the time of the calculation at the first step.
出处
《电脑与信息技术》
2006年第5期35-38,共4页
Computer and Information Technology
关键词
椭圆曲线密码体制
点乘运算
改进方案
elliptic curve cryptosystem
point multiplication
finite field
