The algorithm can greatly reduce the number of elliptic point addition, so the efficiency of scalar multiplication in elliptic curves is improved.
该算法比经典算法减少了点的加法的计算次数，从而加快了椭圆曲线上点的数乘的运算速度。
To accelerate point multiplication operation of elliptic curve cryptography(ECC), a fast reduction algorithm for modular operation was introduced.
为了提高椭圆曲线密码（ECC）的点乘运算速度，提出了一种快速约简求模算法。
Point out that the secure elliptic curve is the master key of constructing the elliptic curve cryptosystem.
安全的椭圆曲线构造和基点的选取，是椭圆曲线密码体制实现的的关键。
应用推荐