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）的点乘运算速度，提出了一种快速约简求模算法。
Point out that the secure elliptic curve is the master key of constructing the elliptic curve cryptosystem.
安全的椭圆曲线构造和基点的选取，是椭圆曲线密码体制实现的的关键。
This paper, firstly introduces the elliptic curve in finite field and algebraic law of its point group, gives the order of the group.
该文首先介绍有限域上定义的椭圆曲线及点群运算规则，给出椭圆曲线点群的阶。
In the implementation of elliptic curve cryptosystem, one of the key steps is to design and implement the base-point choice algorithm of elliptic curve finite group.
实现椭圆曲线密码体制还有一个关键的步骤，就是椭圆曲线有限群基点选取算法的设计与实现。
To resist the side channel attacks of elliptic curve cryptography, a new fast and secure point multiplication algorithm is proposed.
为了抵抗椭圆曲线密码的边信道攻击，提出了一种新型快速安全的标量乘算法。
Therefore, the key of the efficient executing elliptic curve cryptogram is the efficient computing of multiple point.
因此倍点运算的快速计算是椭圆曲线密码快速实现的关键。
The operation consume most time is multiplication of a point on the elliptic curve with an integer in the system, which was called multiple point operation.
椭圆曲线密码体制中，最耗时的运算是倍点运算也就是椭圆曲线上的点与一个整数的乘法运算。
The operation consume most time is multiplication of a point on the elliptic curve with an integer in the system, which was called multiple point operation.
椭圆曲线密码体制中，最耗时的运算是倍点运算也就是椭圆曲线上的点与一个整数的乘法运算。
应用推荐