To accelerate point multiplication operation of elliptic curve cryptography(ECC), a fast reduction algorithm for modular operation was introduced.
为了提高椭圆曲线密码（ECC）的点乘运算速度，提出了一种快速约简求模算法。
Any floating-point operation like addition or multiplication is achieved in a few discrete steps.
任何浮点操作，例如加法和乘法，都可以通过几个步骤来实现。
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.
椭圆曲线密码体制中，最耗时的运算是倍点运算也就是椭圆曲线上的点与一个整数的乘法运算。
应用推荐