elliptic curve point multiplication 椭圆曲线倍点运算
The implementation speed of elliptic curve Cryptography (ECC) depends on the implementation speed of elliptic curve point multiplication.
椭圆曲线点乘的实现速度决定了椭圆曲线密码算法(ECC)的实现速度。
Then, this paper introduces the math foundation required by ECC, including the addition rule for elliptic curve point defined over finite field.
其次介绍了ECC的数学基础，对有限域上椭圆曲线点的运算规则进行了详细描述。
To accelerate point multiplication operation of elliptic curve cryptography(ECC), a fast reduction algorithm for modular operation was introduced.
为了提高椭圆曲线密码（ECC）的点乘运算速度，提出了一种快速约简求模算法。
应用推荐